RPO semantics for mobile ambients†

The paper focuses on the synthesis of labelled transition systems (LTSs) for process calculi, choosing as testbed Mobile Ambients (MAs). The proposal is based on a graphical encoding: a process is mapped into a graph equipped with interfaces, such that the denotation is fully abstract with respect to the standard structural congruence. Graphs with interfaces are amenable to the synthesis mechanism based on borrowed contexts (BCs), an instance of relative pushouts (RPOs). The BC mechanism allows the effective construction of a LTS that has graphs with interfaces as states and labels, and such that the associated bisimilarity is a congruence. Our paper focuses on the analysis of a LTS over processes as graphs with interfaces: we use the LTS on graphs to recover a LTS directly defined over the structure of MAs processes, further defining a set of SOS inference rules capturing the same operational semantics.

[1]  Francesco Zappa Nardelli,et al.  Behavioural Theory for Mobile Ambients , 2004, IFIP TCS.

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

[3]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[4]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[5]  Filippo Bonchi,et al.  Abstract Semantics by Observable Contexts , 2008, ICGT.

[6]  Fabio Gadducci,et al.  On Barbs and Labels in Reactive Systems , 2010, SOS.

[7]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[8]  Fabio Gadducci,et al.  Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes , 2005, Processes, Terms and Cycles.

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

[10]  Hartmut Ehrig,et al.  Concurrent semantics of algebraic graph transformations , 1999 .

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

[12]  Ugo Montanari,et al.  Coalgebraic Models for Reactive Systems , 2007, CONCUR.

[13]  Ugo Montanari,et al.  Saturated Semantics for Reactive Systems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

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

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

[16]  Pawel Sobocinski,et al.  Adhesive and quasiadhesive categories , 2005, RAIRO Theor. Informatics Appl..

[17]  Julian Rathke,et al.  Deconstructing behavioural theories of mobility , 2008, IFIP TCS.

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

[19]  Hartmut Ehrig,et al.  Composition and Decomposition of DPO Transformations with Borrowed Context , 2006, ICGT.

[20]  Vladimiro Sassone,et al.  Reactive systems over cospans , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[21]  Fabio Gadducci,et al.  Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding) , 2008, EXPRESS.

[22]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[23]  Luca Cardelli,et al.  Equational Properties Of Mobile Ambients , 2003, Math. Struct. Comput. Sci..

[24]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[25]  Fabio Gadducci,et al.  Process Bisimulation Via a Graphical Encoding , 2006, ICGT.

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