Encoding mobile ambients into the π-calculus

Authors:
Gabriel Ciobanu;Vladimir A. Zakharov
Affiliations:
"A.I.Cuza" University, Faculty of Computer Science and Romanian Academy, Institute of Computer Science, Iasi;Faculty of Computational Mathematics and Cybernetics, Lomonosov State University, Moscow, Russia
Venue:
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Year:
2006

Citing 13
Cited 4

The reflexive CHAM and the join-calculus

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Controlling interference in ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Mobile ambients

Theoretical Computer Science
Pict: a programming language based on the Pi-Calculus

Proof, language, and interaction
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
Finite-Control Mobile Ambients

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
An Object Calculus for Asynchronous Communication

ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
A Calculus of Mobile Agents

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Verifying Mobile Processes in the HAL Environment

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
The Mobility Workbench - A Tool for the pi-Calculus

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
On the expressiveness of pure safe ambients

Mathematical Structures in Computer Science
Behavioral theory for mobile ambients

Journal of the ACM (JACM)

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

AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Mobility in computer science and in membrane systems

CMC'10 Proceedings of the 11th international conference on Membrane computing
A temporal logic for mutual mobile membranes with objects on surface

Computation, cooperation, and life
Coordinating parallel mobile ambients to solve SAT problem in polynomial number of steps

COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an encoding of the mobile ambients without communication into a subset of the π-calculus, namely the localized sum-free synchronous π-calculus. We prove the operational correspondence between the two formalisms. A key idea of the encoding is the separation of the spatial structure of mobile ambients from their operational semantics. The operational semantics is given by a universal π -process Ruler which communicates with a π-calculus term StructureA simulating the spatial structure of a mobile ambient A by means of channels. We consider the presented encoding as a first step toward designing a fully abstract translation of the calculus of mobile ambients into the π-calculus and thus developing a uniform framework for the theory of mobile computations.