Separation results via leader election problems

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

Volumn 4111 LNCS, Issue , 2006, Pages 172-194

  Vigliotti, Maria Grazia ^a,c   Phillips, Iain ^b   Palamidessi, Catuscia ^c,d  

^a INRIA   (France)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c INRIA   (France)

^d ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; MOBILE COMPUTING; SEMANTICS;

MOBILE AMBIENTS; SYMMETRIC NETWORK;

PROBLEM SOLVING;

EID: 33749605637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11804192_9     Document Type: Conference Paper

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, pages 82-93. ACM, 1980.
2. G. Boudol. Asynchrony and the π-calculus. Technical Report 1702, INRIA Sophia-Antipolis, 1992.
3. L. Bougé. On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes. Acta Informatica, 25:179-201, 1988.
4. L. Cardelli and A.D. Gordon. Anytime, Anywhere: Modal Logic for Mobile Ambients. In Proceedings of the 27th ACM Symposium on Principles of Programming Languages, pages 365-377, 2000.
5. L. Cardelli and A.D. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):177-213, 2000.
6. G. Castagna, J. Vitek, and F. Zappa Nardelli. The Seal calculus. Information and Computation, 201(1):1-54, 2005.
7. C. Ene and T. Muntean. Expressiveness of point-to-point versus broadcast communications. In Proceedings of 12th International Symposium on Fundamentals of Computation Theory (FCT'99), volume 1684 of Lecture Notes in Computer Science, pages 258-268. Springer-Verlag, 1999.
8. D. Gorla. On the relative expressive power of asynchronous communication primitives. In L. Aceto and A. Ingólfsdóttir, editors, Proceedings of 9th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'06), volume 3921 of Lecture Notes in Computer Science, pages 47-62. Springer-Verlag, 2006.
9. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
10. K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proceedings of European Conference on Object-Oriented Programming (ECOOP'91), volume 512 of Lecture Notes in Computer Science, pages 133-147. Springer-Verlag, 1991.
11. N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
12. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
13. R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):269-310, 1992.
14. R. Milner. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, 1999.
15. R. Milner, J. Parrow, and D. Walker. A calculus for mobile processes, parts I and II. Information and Computation, 100(1):1-77, 1992.
16. R. Milner and D. Sangiorgi. Barbed Bisimulation. In Proceedings of the 19th International Colloquium on Automata, Languages and Programming, volume 623 of Lecture Notes in Computer Science, pages 685-695. Springer-Verlag, 1992.
17. U. Nestmann. What is a 'good' encoding of guarded choice? Information and Computation, 156:287-319, 2000.
18. U. Nestmann. Modeling consensus in a process calculus. In Proceedings of CONCUR'03, volume 2761 of Lecture Notes in Computer Science, pages 393-407. Springer-Verlag, 2003.
19. U. Nestmann and B.C. Pierce. Decoding Choice Encodings. Information and Computation, 163(1):1-59, 2000.
20. C. Palamidessi. Comparing the expressive power of the synchronous and the asynchronous π-calculus. In Proceedings of the 25th ACM Symposium on Principles of Programming Languages, pages 256-265. ACM, 1997.
21. C. Palamidessi. Comparing the expressive power of the synchronous and the asynchronous π-calculi. Mathematical Structures in Computer Science, 13(5):685-719, 2003.
22. I.C.C. Phillips. CCS with priority guards. In Proceedings of 12th International Conference on Concurrency Theory, CONCUR 2001, volume 2154 of Lecture Notes in Computer Science, pages 305-320. Springer-Verlag, 2001.
23. I.C.C. Phillips and M.G. Vigliotti. Symmetric electoral systems for ambient calculi. Submitted.
24. I.C.C. Phillips and M.G. Vigliotti. Electoral systems in ambient calculi. In Proceedings of 7th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2004, volume 2987 of Lecture Notes in Computer Science, pages 408-422. Springer-Verlag, 2004.
25. I.C.C. Phillips and M.G. Vigliotti. Leader election in rings of ambient processes. Theoretical Computer Science, 356(3) :468-494, 2006.
26. B.C. Pierce and D.N. Turner. Pict: A programming language based on the picalculus. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, pages 455-494. MIT Press, 2000.
27. K.V.S. Prasad. Broadcast Calculus Interpreted in CCS up to Bisimulation. In Proceedings of Express'01, volume 52 of Electronic Notes in Theoretical Computer Science, pages 83-100. Elsevier, 2002.
28. D. Sangiorgi. Expressing Mobility in Process Algebra: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1993.
29. D. Sangiorgi and D. Walker. The π-Calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
30. G. Tel. Distributed Algorithms. Cambridge University Press, 2000.
31. M.G. Vigliotti. Reduction Semantics for Ambient Calculi. PhD thesis, Imperial College London, 2004.
32. N. Yoshida. Graph Types for Monadic Mobile Process Calculi. In Proceedings of 16th FST/TCS, volume 1180 of Lecture Notes in Computer Science, pages 371-386. Springer-Verlag, 1996.