Leader election in rings of ambient processes

Theoretical Computer Science

Volumn 356, Issue 3, 2006, Pages 468-494

  Phillips, Iain ^a   Vigliotti, Maria Grazia ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

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

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATION THEORY; SIGNAL ENCODING;

AMBIENT CALCULI; ELECTORAL SYSTEM; EXPRESSIVENESS; LEADER ELECTION; RING;

PROBLEM SOLVING;

EID: 33646136468     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.02.004     Document Type: Article

References (21)

1. D. Angluin, Local and global properties in networks of processors, in: Proc. 12th Annu. ACM Symp. on Theory of Computing, 1980, pp. 82-93.
2. Bergstra J., and Klop J. Process algebra for synchronous communication. Inform. Control 60 1-3 (1984) 109-137
3. Boneva I., and Talbot J.-M. When ambients cannot be opened. Theoret. Comput. Sci. 333 1-2 (2005) 127-169
4. Bougé L. On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes. Acta Inform. 25 (1988) 179-201
5. Bugliesi M., Castagna G., and Crafa S. Access control for mobile agents: the calculus of Boxed ambients. ACM Trans. Program. Lang. Syst. 26 1 (2004) 57-124
6. Cardelli L., and Gordon A. Mobile ambients. Theoret. Comput. Sci. 240 1 (2000) 177-213
7. Guan X., Yang Y., and You J. Making ambients more robust. Proc. Internat. Conf. Software: Theory and Practice. Beijing, China, August 2000 (2000) 377-384
8. Hoare C. Communicating Sequential Processes (1985), Prentice-Hall, Englewood Cliffs
9. Levi F., and Sangiorgi D. Mobile safe ambients. ACM Trans. Program. Lang. Syst. 25 1 (2003) 1-69
10. Maffeis S., and Phillips I. On the computational strength of pure ambient calculi. Theoret. Comput. Sci. 330 3 (2005) 501-551
11. M. Merro, M. Hennessy, A bisimulation-based semantic theory of safe ambients, ACM Trans. Program. Lang. Syst., 2006, in press.
12. Milner R. Communication and Concurrency (1989), Prentice-Hall, Englewood Cliffs
13. Milner R. Communicating and Mobile Systems: the π-calculus (1999), Cambridge University Press, Cambridge, England
14. Milner R., Parrow J., and Walker D. A calculus of mobile processes. Inform. and Comput. 100 (1992) 1-77
15. Palamidessi C. Comparing the expressive power of the synchronous and asynchronous π-calculi. Math. Struct. Comput. Sci. 13 5 (2003) 685-719
16. Phillips I., and Vigliotti M. On reduction semantics for the push and pull ambient calculus. Proc. IFIP Internat. Conf. on Theoretical Computer Science (TCS 2002), IFIP 17th World Computer Congress. August 2002, Kluwer, Montreal (2002) 550-562
17. I. Phillips, M. Vigliotti, Electoral systems in ambient calculi, in: Proc. 7th Internat. Conf. on Foundations of Software Science and Computation Structures, FoSSaCS 2004, Lecture Notes in Computer Science, Vol. 2987, Springer, Berlin, 2004, pp. 408-422.
18. I. Phillips, M. Vigliotti, Leader election in rings of ambient processes, in: Proc. Express: Workshop on Expressiveness in Concurrency, London, August 2004, Electronic Notes in Theoretical Computer Science, Vol. 128.2, Elsevier, New York, NY, 2005, pp. 185-199.
19. Sangiorgi D. Pi-calculus, internal mobility and agent-passing calculi. Theoret. Comput. Sci. 167 1-2 (1996) 235-274
20. M. Vigliotti, Reduction semantics for ambient calculi, Ph.D. Thesis, Imperial College, University of London, 2004.
21. Zimmer P. On the expressiveness of pure safe ambients. Math. Struct. Comput. Sci. 13 5 (2003) 721-770