Process Bisimulation Via a Graphical Encoding

The paper presents a case study on the synthesis of labelled transition systems (ltss) for process calculi, choosing as testbed Milner's Calculus of Communicating System (ccs). The proposal is based on a graphical encoding: each ccs process is mapped into a graph equipped with suitable interfaces, such that the denotation is fully abstract with respect to the usual structural congruence. Graphs with interfaces are amenable to the synthesis mechanism based on borrowed contexts (bcs), proposed by Ehrig and Konig (which are an instance of relative pushouts, originally introduced by Milner and Leifer). The bc mechanism allows the effective construction of an lts that has graphs with interfaces as both states and labels, and such that the associated bisimilarity is automatically a congruence. Our paper focuses on the analysis of the lts distilled by exploiting the encoding of ccs processes: besides offering some technical contributions towards the simplification of the bc mechanism, the key result of our work is the proof that the bisimilarity on processes obtained via bcs coincides with the standard strong bisimilarity for ccs.

[1]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[2]  Andrea Corradini,et al.  Processes for Adhesive Rewriting Systems , 2006, FoSSaCS.

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

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

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

[6]  Fabio Gadducci,et al.  An inductive view of graph transformation , 1997, WADT.

[7]  Vladimiro Sassone,et al.  Deriving Bisimulation Congruences using 2-categories , 2003, Nord. J. Comput..

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

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

[10]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series) , 1992 .

[11]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

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

[13]  Fabio Gadducci,et al.  Term Graph Rewriting for the pi-Calculus , 2003, APLAS.

[14]  Hartmut Ehrig,et al.  Adhesive High-Level Replacement Categories and Systems , 2004, ICGT.

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

[16]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[17]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[18]  Robin Milner,et al.  Bigraphs and transitions , 2003, POPL '03.

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

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

[21]  Peter Sewell,et al.  From rewrite rules to bisimulation congruences , 2002, Theor. Comput. Sci..

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

[23]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

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

[25]  Philip Wadler,et al.  A Syntax for Linear Logic , 1993, MFPS.

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

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

[28]  Martin Wirsing,et al.  Extraction of Structured Programs from Specification Proofs , 1999, WADT.

[29]  Reiko Heckel,et al.  A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting , 1999, CTCS.

[30]  Vincent van Oostrom,et al.  Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday , 2005, Processes, Terms and Cycles.

[31]  Hartmut Ehrig,et al.  Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting , 2004, FoSSaCS.

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

[33]  Joost Engelfriet,et al.  Multisets and Structural Congruence of the pi-Calculus with Replication , 1999, Theor. Comput. Sci..

[34]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.