Leader election in rings of ambient processes

Electronic Notes in Theoretical Computer Science

Volumn 128, Issue 2, 2005, Pages 185-199

  Phillips, Iain ^a   Vigliotti, Maria Grazia ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Ambient calculi; Electoral systems; Expressiveness; Rings

Indexed keywords

AMBIENT CALCULI; ELECTORAL SYSTEMS; EXPRESSIVENESS; RINGS;

ALGEBRA; CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; ENCODING (SYMBOLS); PROBLEM SOLVING;

MATHEMATICAL TECHNIQUES;

EID: 15844371540     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.11.036     Document Type: Conference Paper

References (18)

1. Angluin, D., Local and global properties in networks of processors, in: Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980, pp. 82-93
2. J. Bergstra, and J. Klop Process algebra for synchronous communication Information and Control 60 1984 109 137
3. I. Boneva, and J.-M. Talbot When ambients cannot be opened Proceedings of 6th International Conference on Foundations of Software Science and Computation Structures FoSSaCS 2003 Lecture Notes in Computer Science 2620 2003 169 184 full version to appear in Theoretical Computer Science
4. L. Bougé On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes Acta Informatica 25 1988 179 201
5. M. Bugliesi, G. Castagna, and S. Crafa Access control for mobile agents: the calculus of Boxed Ambients ACM Transactions on Programming Languages and Systems 26 2004 57 124
6. L. Cardelli, and A. Gordon Mobile ambients Theoretical Computer Science 240 2000 177 213
7. X. Guan, Y. Yang, and J. You Making ambients more robust Proceedings of International Conference on Software: Theory and Practice Beijing, China, August 2000 2000 377 384
8. C. Hoare Communicating Sequential Processes 1985 Prentice-Hall
9. F. Levi, and D. Sangiorgi Mobile safe ambients ACM Transactions on Programming Languages and Systems 25 2003 1 69
10. Maffeis, S. and I. Phillips, On the computational strength of pure ambient calculi, Theoretical Computer Science (2005), accepted
11. R. Milner Communication and Concurrency 1989 Prentice-Hall
12. R. Milner, J. Parrow, and D. Walker A calculus of mobile processes Information and Computation 100 1992 1 77
13. C. Palamidessi Comparing the expressive power of the synchronous and asynchronous π-calculus Mathematical Structures in Computer Science 13 2003 685 719
14. I. Phillips, and M. Vigliotti On reduction semantics for the push and pull ambient calculus Proceedings of IFIP International Conference on Theoretical Computer Science (TCS 2002), IFIP 17th World Computer Congress, August 2002, Montreal 2002 550 562
15. I. Phillips, and M. Vigliotti Electoral systems in ambient calculi Proceedings of 7th International Conference on Foundations of Software Science and Computation Structures FoSSaCS 2004 Lecture Notes in Computer Science 2987 2004 408 422
16. Phillips, I. and M. Vigliotti, Leader election in rings of ambient processes, Technical report, Department of Computing, Imperial College London (2004)
17. Vigliotti, M., "Reduction semantics for ambient calculi," Ph.D. thesis, Imperial College, University of London (2004)
18. P. Zimmer On the expressiveness of pure safe ambients Mathematical Structures in Computer Science 13 2003 721 770