Encoding Mobile Ambients into the π-Calculus

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 mobi...

Full description

Saved in:
Bibliographic Details
Published inPerspectives of Systems Informatics Vol. 4378; pp. 148 - 165
Main Authors Virbitskaite, Irina, Voronkov, A
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2007
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Case Ruler
Intended Meaning
Mobile Computation
Operational Semantic
Reduction Step
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783540708803
3540708804
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-70881-0_15