On the expressiveness of the π-calculus and the mobile ambients

Authors:
Linda Brodo
Affiliations:
Dipartimento di Scienze dei Linguaggi, University of Sassari, Sassari, Italy
Venue:
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Year:
2010

Citing 14
Cited 0

A calculus of mobile processes, I

Information and Computation
Controlling interference in ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mobile ambients

Theoretical Computer Science
Computing with membranes

Journal of Computer and System Sciences
Enhanced operational semantics: a tool for describing and analyzing concurrent systems

ACM Computing Surveys (CSUR)
An Asynchronous, Distributed Implementation of Mobile Ambients

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the expressiveness of pure safe ambients

Mathematical Structures in Computer Science
Translating Mobile Ambients into P Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Symmetric electoral systems for ambient calculi

Information and Computation
A Decentralized Implementation of Mobile Ambients

ICGT '08 Proceedings of the 4th international conference on Graph Transformations
On the Relative Expressive Power of Calculi for Mobility

Electronic Notes in Theoretical Computer Science (ENTCS)
Ambient Graph Rewriting

Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding mobile ambients into the π-calculus

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
On recursion, replication and scope mechanisms in process calculi

FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the expressivity of two classical distributed paradigms by defining an encoding of the pure mobile ambient calculus into the synchronous p-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.