Hostname: page-component-76fb5796d-qxdb6 Total loading time: 0 Render date: 2024-04-26T22:25:55.751Z Has data issue: false hasContentIssue false
  • English
  • Français

On the expressiveness of π-calculus for encoding mobile ambients

Published online by Cambridge University Press:  22 September 2016

LINDA BRODO
LINDA BRODO*
Affiliation:
Dipartimento di Scienze Politiche, Scienze della Comunicazione e Ingegneria, dell'Informazione, Università degli Studi di Sassari, viale Mancini, 5 - 07100 - Sassari, Italia Email: brodo@uniss.it
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We investigate the expressiveness of two classical distributed paradigms by defining the first encoding of the pure mobile ambient calculus into the synchronous π-calculus. Our encoding, whose correctness has been proved by relying on the notion of operational correspondence, shows how the hierarchical ambient structure can be reformulated within a flat channel interconnection amongst independent processes, without centralised control. To easily handle the computation for simulating a capability, we introduce the notions of simulating trace (representing the computation that a π-calculus process has to execute to mimic a capability) and of aborting trace (representing the computation that a π-calculus process executes when the simulation of a capability cannot succeed). Thus, the encoding may introduce loops, but, as it will be shown, the number of steps of any trace, therefore of any aborting trace, is limited, and the number of states of the transition system of the encoding processes still remains finite. In particular, an aborting trace makes a sort of backtracking, leaving the involved sub-processes in the same starting configurations. We also discuss two run-time support methods to make these loops harmless at execution time. Our work defines a relatively simple, direct, and precise translation that reproduces the ambient structure by means of channel links, and keeps track of the dissolving of an ambient.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 28 , Issue 2 , February 2018 , pp. 202 - 240
Copyright
Copyright © Cambridge University Press 2016 

References

Bodei, C., Brodo, L. and Bruni, R. (2013). Open multiparty interaction. In: Martí-Oliet, N. and Palomino, M. (eds.) Recent Trends in Algebraic Development Techniques, Lecture Notes in Computer Science, volume 7841, Springer, Berlin Heidelberg, 1–23.Google Scholar
Bodei, C., Brodo, L., Bruni, R. and Chiarugi, C. (2014). A flat process calculus for nested membrane interactions. Scientific Annals of Computer Science 24 (1) 91–136.Google Scholar
Brodo, L. (2011). On the expressiveness of the π-calculus and the mobile ambients. In: Johnson, M. and Pavlovic, D. (eds.) AMAST-Algebraic Methodology and Software Technology, Lecture Notes in Computer Science, volume 6486, Springer-Verlag, 44–59.Google Scholar
Brodo, L., Degano, P. and Priami, C. (2003). Reflecting mobile ambients into the π-calculus. In: Priami, C. (ed.) Global Computing. Programming Environments, Languages, Security, and Analysis of Systems, Lecture Notes in Computer Science, volume 2874, Springer, Berlin Heidelberg, 25–56.CrossRefGoogle Scholar
Busi, N., Gabbrielli, M. and Zavattaro, G. (2009). On the expressive power of recursion, replication and iteration in process calculi. Mathematical Structures in Computer Science 19 (6) 1191–1222.CrossRefGoogle Scholar
Cardelli, L. (2005). Brane calculi - interactions of biological membranes. In: Danos, V. and Schachter, V. (eds.) Computational Methods in Systems Biology, Lecture Notes in Computer Science, volume 3082, Springer, Berlin Heidelberg, 257–278.Google Scholar
Cardelli, L. and Gordon, A. (2000). Mobile ambients. Theoretical Computer Science 240 (1) 177–213.CrossRefGoogle Scholar
Cenciarelli, P., Talamo, I. and Tiberi, A. (2005). Ambient graph rewriting. Electronic Notes in Theoretical Computer Science, volume 117, Elsevier, 335–351.Google Scholar
Ciobanu, G. and Zakharov, V.A. (2007). Encoding mobile ambients into the π-calculus. In: Virbitskaite, I. and Voronkov, A. (eds.) Perspectives of Systems Informatics, Lecture Notes in Computer Science, volume 4378, Springer, Berlin Heidelberg, 148–165.CrossRefGoogle Scholar
Fournet, C., Lévy, J.-J. and Schmitt, A. (2000). An asynchronous, distributed implementation of mobile ambients. In: Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D. and Ito, T. (eds.) Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics, Lecture Notes in Computer Science, volume 1872, Springer, Berlin Heidelberg, 348–364.CrossRefGoogle Scholar
Gadducci, F. and Monreale, G.V. (2010). A decentralized implementation of mobile ambients. The Journal of Logic and Algebraic Programming 80 (2) 113–136.CrossRefGoogle Scholar
Gorla, D. (2010). A taxonomy of process calculi for distribution and mobility. Distributed Computing 23 (4) 273–299.Google Scholar
Levi, F. and Sangiorgi, D. (2003). Mobile safe ambients. ACM Transactions on Programming Languages and Systems (TOPLAS) 25 (1) 1–69.CrossRefGoogle Scholar
Milner, R., Parrow, J. and Walker, D. (1992). A calculus of mobile processes, part 1–2. Information and Computation 100 (1) 1–77.CrossRefGoogle Scholar
Palamidessi, C. (2003). Comparing the expressive power of the synchronous and the asynchronous pi-calculus. Mathematical Structures in Computer Science 15 (5) 685–719.Google Scholar
Parrow, J. (2001). An introduction to the π-calculus. In: Handbook of Process Algebra, Elsevier Science, 479–543.Google Scholar
Pǎun, Gh. (2000). Computing with membranes. Computer and System Sciences 61 (1) 108–143.CrossRefGoogle Scholar
Phillips, I. and Vigliotti, M.G. (2008). Symmetric electoral systems for ambient calculi. Information and Computation 206 (1) 34–72.CrossRefGoogle Scholar
Sangiorgi, D. (1996). Pi-calculus, internal mobility, and agent-passing calculi. Theoretical Computer Science 167 (1&2) 235–274.CrossRefGoogle Scholar
Zimmer, P. (2003). On the expressiveness of the pure safe ambients. Mathematical Structures in Computer Science 13 (5) 721–770.CrossRefGoogle Scholar