Electoral systems in ambient calculi

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2987, Issue , 2004, Pages 408-422

  Phillips, Lain ^a   Vigliotti, Maria Grazia ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTATION THEORY; PATHOLOGY;

AMBIENT CALCULI; ELECTORAL SYSTEMS; MIXED CHOICE; MOBILE AMBIENTS; PI CALCULUS; SAFE AMBIENTS; SYMMETRIC NETWORK;

CALCULATIONS;

EID: 21144443616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_29     Document Type: Article

References (23)

1. D. Angluin. Local and global properties in networks of processors. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing, page 82-93. ACM, 1980.
2. H. Attiya and J. Welch. Distributed Computing. The McGraw-Hill Companies, 1998.
3. G. Boudol. Asynchrony and the π-calculus. Technical Report 1702, INRIA SophiaAntipolis, 1992.
4. L. Bougé. On the existence of symmetric algorithms to find the leaders in networks of communicating sequential systems. Acta. Informatica, 25:179-201, 1988.
5. M. Bugliesi, G. Castagna, and S. Crafa. Boxed ambients. In Proceedings of TACAS'01, volume 2215 of LNCS, pages 38-63. Springer-Verlag, 2001.
6. M. Carbone and S. Maffeis. On the Expressive Power of Polyadic Synchronisation in π-calculus. Nordic Journal of Computing, 10(2):70-98, 2003.
7. L. Cardelli and A.D. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):177-213, 2000.
8. T. Chothia and I. Stark. Encoding distributed areas and local communication into the pi-calculus. In Proceedings of HLCL'00, volume 52 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2000.
9. C. Ene and T. Muntian. Expressiveness of point-to-point versus broadcast communication. In Proceedings of FCT'99, volume 1684 of LNCS, pages 258-268. Springer-Verlag, 1999.
10. M. Hennessy and J. Riely. Resource access control in systems of mobile agents. In Proceedings of HLCL'98, volume 16.3 of Electronic Notes in Theoretical Computer Science, pages 3-17. Elsevier Science Publishers, 1998.
11. K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proceedings of ECOOP'91, volume 512 of LNCS, pages 133-147. Springer-Verlag, 1991.
12. K. Honda and N. Yoshida. On Reduction-Based Process Semantics. Theoretical Computer Science, 151:437-486, 1995.
13. F. Levi and D. Sangiorgi. Controlling Interference for Ambients. ACM Transactions on Programming Languages and Systems, 25(1):l-69, 2003.
14. N.A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
15. R. Milner. Communicating and Mobile Systems: the π-calculus. Cambridge University Press, 1999.
16. R. Milner, J. Parrow, and D. Walker. A calculus for mobile processes, parts I and II. Information and Computation, 100 (1):l-77, 1992.
17. U. Nestmann. What is a 'Good' Encoding of Guarded Choice? Journal of Information and Computation, 156:287-319, 2000.
18. C. Palamidessi. Comparing the Expressive Power of the Synchronous and Asynchronous π-calculus. Mathematical Structures in Computer Science, 13(5):685-719, 2003.
19. I.C.C. Phillips and M.G. Vigliotti. On Reduction Semantics for the Push and Pull Ambient Calculus. In Proceedings of IFIP International Conference on Theoretical Computer Science, pages 550-562, August 2002.
20. D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
21. M.G. Vigliotti. Reduction Semantics for Ambient Calculi. PhD thesis, Imperial College, 2004. Forthcoming.
22. J. Vitek and G. Castagna. Seal: A framework for secure mobile computation. In Proceedings of Internet Programming Languages, volume 1686 of LNCS, pages 47-77. Springer-Verlag, 1999.
23. P. Zimmer. On the Expressiveness of Pure Safe Ambients. Mathematical Structures in Computer Science, 13(5):721-770, 2003.