A decentralised graphical implementation of mobile ambients

Abstract We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non-hierarchical) graphs and it is sound and complete with respect to the structural congruence of the calculus (i.e., two processes are equivalent iff mapped to isomorphic graphs). With respect to alternative proposals for the graphical implementation of mobile ambients, our encoding distinguishes the syntactic structure of a process from the activation order of its components. Our solution faithfully captures a basic feature of the calculus (ambients can be nested and reductions are propagated across the nesting) and it allows to model the reduction semantics via a graph transformation system containing just three rules.

[1]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach , 1997, Handbook of Graph Grammars.

[2]  Roberto Bruni,et al.  Normal forms for algebras of connection , 2002, Theor. Comput. Sci..

[3]  Fabio Gadducci,et al.  Reactive Systems, Barbed Semantics, and the Mobile Ambients , 2009, FoSSaCS.

[4]  Fabio Gadducci,et al.  Synthesising CCS bisimulation using graph rewriting , 2009, Inf. Comput..

[5]  Davide Sangiorgi,et al.  An efficient abstract machine for Safe Ambients , 2007, J. Log. Algebraic Methods Program..

[6]  Ugo Montanari,et al.  An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures , 1998, FoSSaCS.

[7]  Fabio Gadducci,et al.  An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories , 1999, Appl. Categorical Struct..

[8]  Annegret Habel,et al.  Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.

[9]  Fabio Gadducci.  Graph rewriting for the pi-calculus , 2007, Math. Struct. Comput. Sci..

[10]  Annegret Habel,et al.  Double-pushout graph transformation revisited , 2001, Mathematical Structures in Computer Science.

[11]  Robin Milner,et al.  Pure bigraphs: Structure and dynamics , 2006, Inf. Comput..

[12]  Davide Sangiorgi,et al.  Mobile safe ambients , 2003, TOPL.

[13]  Emilio Tuosto,et al.  A LTS Semantics of Ambients via Graph Synchronization with Mobility , 2001, ICTCS.

[14]  Hartmut Ehrig,et al.  Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts , 2006, Mathematical Structures in Computer Science.

[15]  Narciso Martí-Oliet.  Rewriting logic and its applications , 1997, APPIA-GULP-PRODE.

[16]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[17]  Fabio Gadducci,et al.  A Concurrent Graph Semantics for Mobile Ambients , 2001, MFPS.

[18]  Luca Cardelli,et al.  BioAmbients: an abstraction for biological compartments , 2004, Theor. Comput. Sci..

[19]  Luca Cardelli,et al.  A spatial logic for concurrency (part I) , 2003, Inf. Comput..

[20]  Nicolás Mylonakis Pascual,et al.  Another fully abstract graph semantics for the ambient calculus , 2007 .

[21]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[22]  Pietro Cenciarelli,et al.  Ambient Graph Rewriting , 2004, WRLA.

[23]  Francesca Rossi,et al.  Graph Processes , 1996, Fundam. Informaticae.

[24]  Robin Milner,et al.  Bigraphs and mobile processes , 2003 .

[25]  Fabio Gadducci,et al.  A Decentralized Implementation of Mobile Ambients , 2008, ICGT.