Symmetric electoral systems for ambient calculi

Information and Computation

Volumn 206, Issue 1, 2008, Pages 34-72

  Phillips, Iain ^a   Vigliotti, Maria Grazia ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

calculus; Ambient calculi; Electoral system; Expressiveness; Leader election

Indexed keywords

ASYNCHRONOUS GENERATORS; CALCULATIONS; ENCODING (SYMBOLS); PROBLEM SOLVING; YIELD STRESS;

AMBIENT CALCULI; ELECTORAL SYSTEM; ELECTORAL SYSTEMS; EXPRESSIVENESS; MOBILE AMBIENTS (MA); SAFE AMBIENTS (SA);

NUMERICAL METHODS;

EID: 37049029172     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.08.005     Document Type: Article

References (32)

1. D. Angluin, Local and global properties in networks of processors, in: Proceedings of the 12th Annual ACM Symposium on Theory of Computing, ACM, 1980, pp. 82-93.
2. Baeten J.C.M., and Weijland W.P. Process Algebra (1990), Cambridge University Press
3. G. Boudol, Asynchrony and the π-calculus. Technical Report 1702, INRIA Sophia-Antipolis, 1992.
4. Bougé L. On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes. Acta Informatica 25 (1988) 179-201
5. Bugliesi M., Castagna G., and Crafa S. Access control for mobile agents: the calculus of Boxed Ambients. ACM Transactions on Programming Languages and Systems 26 1 (2004) 57-124
6. Busi N., and Zavattaro G. On the expressive power of movement and restriction in pure mobile ambients. Theoretical Computer Science 322 3 (2004) 477-515
7. L. Cardelli, Mobility and security, in: F.L. Bauer, R. Steinbrggen (Eds.), Proceedings of the NATO Advanced Study Institute on Foundations of Secure Computation, Marktoberdorf, Germany, 27 July-8 August 1999, NATO Science Series, IOS Press, 2000, pp. 3-37.
8. Cardelli L., and Gordon A.D. Mobile ambients. Theoretical Computer Science 240 1 (2000) 177-213
9. Castagna G., Vitek J., and Zappa Nardelli F. The Seal calculus. Information and Computation 201 1 (2005) 1-54
10. T. Chothia, I. Stark, Encoding distributed areas and local communication into the pi-calculus, in: Proceedings of 8th International Workshop on Expressiveness in Concurrency (EXPRESS'01), Electronic Notes in Theoretical Computer Science, vol. 52, Elsevier Science Publishers, 2002, pp. 101-119.
11. C. Ene, T. Muntean, Expressiveness of point-to-point versus broadcast communications, in: Proceedings of 12th International Symposium on Fundamentals of Computation Theory (FCT '99), Lecture Notes in Computer Science, vol. 1684, Springer-Verlag, 1999, pp. 258-268.
12. C. Fournet, J.J. Lévy, A. Schmitt, An asynchronous, distributed implementation of Mobile Ambients, in: Proceedings of IFIP International Conference on Theoretical Compute Science (TCS 2000), Lecture notes in computer science, vol. 1872, Springer-Verlag, 2000, pp. 348-364.
13. Hennessy M.C.B., and Riely J. Resource access control in systems of mobile agents. Information and Computation 173 1 (2002) 82-120
14. Hoare C.A.R. Communicating sequential processes. Communications of the ACM 21 8 (1978) 666-677
15. Hoare C.A.R. Communicating Sequential Processes (1985), Prentice-Hall
16. K. Honda, M. Tokoro, An object calculus for asynchronous communication, in: Proceedings of European Conference on Object-Oriented Programming (ECOOP'91), Lecture Notes in Computer Science, vol. 512, Springer-Verlag, 1991, pp. 133-147.
17. Levi F., and Sangiorgi D. Mobile safe ambients. ACM Transactions on Programming Languages and Systems 25 1 (2003) 1-69
18. Lynch N. Distributed Algorithms (1996), Morgan Kaufmann
19. Maffeis S., and Phillips I.C.C. On the computational strength of pure ambient calculi. Theoretical Computer Science 330 3 (2005) 501-551
20. Milner R. Communication and Concurrency (1989), Prentice-Hall
21. Milner R. Communicating and Mobile Systems: The π-Calculus (1999), Cambridge University Press
22. Milner R., Parrow J., and Walker D. A calculus for mobile processes, parts I and II. Information and Computation 100 1 (1992) 1-77
23. Nestmann U. What is a 'good' encoding of guarded choice?. Information and Computation 156 (2000) 287-319
24. Palamidessi C. Comparing the expressive power of the synchronous and the asynchronous π-calculi. Mathematical Structures in Computer Science 13 5 (2003) 685-719
25. Parrow J. An introduction to the π-calculus. Handbook of Process Algebra (2001), Elsevier 479-543 (Chapter 8)
26. I.C.C. Phillips, M.G. Vigliotti, On reduction semantics for the Push and Pull Ambient Calculus, in: Proceedings of IFIP International Conference on Theoretical Computer Science (TCS 2002), Kluwer, 2002, pp. 550-562.
27. I.C.C. Phillips, M.G. Vigliotti, Electoral systems in ambient calculi, in: Proceedings of 7th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2004, Lecture Notes in Computer Science, vol. 2987, Springer-Verlag, 2004, pp. 408-422.
28. Phillips I.C.C., and Vigliotti M.G. Leader election in rings of ambient processes. Theoretical Computer Science 356 3 (2006) 468-494
29. Sangiorgi D., and Walker D. The π-Calculus: A Theory of Mobile Processes (2001), Cambridge University Press
30. Tel G. Distributed Algorithms (2000), Cambridge University Press
31. M.G. Vigliotti, Reduction Semantics for Ambient Calculi, PhD Thesis, Imperial College London, 2004.
32. Zimmer P. On the expressiveness of pure Safe Ambients. Mathematical Structures in Computer Science 13 5 (2003) 721-770