Abstract
This paper compares the expressiveness of ambient calculi against different dialects of the pi-calculus. Cardelli and Gordon encoded the asynchronous pi-calculus into their calculus of Mobile Ambients (MA). Zimmer has shown that the synchronous pi-calculus without choice can be encoded in pure (no communication) Safe Ambients. We show that pure MA without restriction has symmetric electoral systems, that is, it is possible to solve the problem of electing a leader in a symmetric network. By the work of Palamidessi, this implies that pure MA without restriction is not encodable (under certain conditions) in the pi-calculus with separate choice. We adapt the work of Carbone and Maffeis to show that pure MA cannot be encoded (under certain other conditions) into the pi-calculus with mixed choice (but without matching).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pp. 82–93. ACM Press, New York (1980)
Attiya, H., Welch, J.: Distributed Computing. The McGraw-Hill Companies, New York (1998)
Boudol, G.: Asynchrony and the π-calculus. Technical Report 1702, INRIA Sophia- Antipolis (1992)
Bougé, L.: On the existence of symmetric algorithms to find the leaders in networks of communicating sequential systems. Acta Informatica 25, 179–201 (1988)
Bugliesi, M., Castagna, G., Crafa, S.: Boxed ambients. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 38–63. Springer, Heidelberg (2001)
Carbone, M., Maffeis, S.: On the Expressive Power of Polyadic Synchronisation in π-calculus. Nordic Journal of Computing 10(2), 70–98 (2003)
Cardelli, L., Gordon, A.D.: Mobile ambients. Theoretical Computer Science 240(1), 177–213 (2000)
Chothia, T., Stark, I.: Encoding distributed areas and local communication into the pi-calculus. In: Proceedings of HLCL 2000. Electronic Notes in Theoretical Computer Science, vol. 52, Elsevier Science Publishers, Amsterdam (2000)
Ene, C., Muntian, T.: Expressiveness of point-to-point versus broadcast communication. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 258–268. Springer, Heidelberg (1999)
Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. In: Proceedings of HLCL 1998. Electronic Notes in Theoretical Computer Science, vol. 16.3, pp. 3–17. Elsevier Science Publishers, Amsterdam (1998)
Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133–147. Springer, Heidelberg (1991)
Honda, K., Yoshida, N.: On Reduction-Based Process Semantics. Theoretical Computer Science 151, 437–486 (1995)
Levi, F., Sangiorgi, D.: Controlling Interference for Ambients. ACM Transactions on Programming Languages and Systems 25(1), 1–69 (2003)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
Milner, R.: Communicating and Mobile Systems: the π-calculus. Cambridge University Press, Cambridge (1999)
Milner, R., Parrow, J., Walker, D.: A calculus for mobile processes, parts I and II. Information and Computation 100(1), 1–77 (1992)
Nestmann, U.: What is a ‘Good’ Encoding of Guarded Choice? Journal of Information and Computation 156, 287–319 (2000)
Palamidessi, C.: Comparing the Expressive Power of the Synchronous and Asynchronous π-calculus. Mathematical Structures in Computer Science 13(5), 685–719 (2003)
Phillips, I.C.C., Vigliotti, M.G.: On Reduction Semantics for the Push and Pull Ambient Calculus. In: Proceedings of IFIP International Conference on Theoretical Computer Science, August 2002, pp. 550–562 (2002)
Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
Vigliotti, M.G.: Reduction Semantics for Ambient Calculi. PhD thesis, Imperial College (2004) (forthcoming)
Vitek, J., Castagna, G.: Seal: A framework for secure mobile computation. In: Bal, H.E., Cardelli, L., Belkhouche, B. (eds.) ICCL-WS 1998. LNCS, vol. 1686, pp. 47–77. Springer, Heidelberg (1999)
Zimmer, P.: On the Expressiveness of Pure Safe Ambients. Mathematical Structures in Computer Science 13(5), 721–770 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Phillips, I., Vigliotti, M.G. (2004). Electoral Systems in Ambient Calculi. In: Walukiewicz, I. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2004. Lecture Notes in Computer Science, vol 2987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24727-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-24727-2_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21298-0
Online ISBN: 978-3-540-24727-2
eBook Packages: Springer Book Archive