We investigate the expressivity of two classical distributed paradigms by defining an encoding of the pure mobile ambient calculus into the synchronous π-calculus. We show that the encoding is complete and 'weakly' sound, since it may introduce loops. For this purpose we introduce the notions of simulating trace and of aborting trace. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Brodo, L. (2011). On the expressiveness of the π-calculus and the mobile ambients. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6486 LNCS, pp. 44–59). https://doi.org/10.1007/978-3-642-17796-5_3
Mendeley helps you to discover research relevant for your work.