Concurrent Rewriting for Graphs with Equivalences

Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to coalesce some parts of the graph. This latter feature forbids the development of a satisfactory concurrent semantics for rewrites (intended as a partial order description of the steps in a computation). This paper proposes the use of graphs with equivalences, i.e., (typed hyper-) graphs equipped with an equivalence over nodes, for the analysis of distributed systems. The formalism is amenable to the tools of the double-pushout approach to rewriting, including the theoretical results associated to its concurrent features. The formalism is tested against the encoding of a simple calculus with name mobility, namely the solo calculus.

[1]  D. Walker,et al.  A Calculus of Mobile Processes, Part I , 1989 .

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

[3]  Cosimo Laneve,et al.  Solos In Concert , 2003, Math. Struct. Comput. Sci..

[4]  Wolfgang Reisig,et al.  The Non-sequential Behavior of Petri Nets , 1983, Inf. Control..

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

[6]  Ugo Montanari,et al.  Unfolding and Event Structure Semantics for Graph Grammars , 1999, FoSSaCS.

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

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

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

[10]  Cosimo Laneve,et al.  Solos in Concert , 1999, ICALP.

[11]  Philippa Gardner,et al.  Explicit fusions , 2000, Theor. Comput. Sci..

[12]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

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

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

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

[16]  Philippa Gardner,et al.  Explicit Fusions , 2000, MFCS.

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

[18]  Hartmut Ehrig,et al.  Parallelism and concurrency in high-level replacement systems , 1991, Mathematical Structures in Computer Science.

[19]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

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

[21]  Fabio Gadducci,et al.  Graph Processes with Fusions: Concurrency by Colimits, Again , 2005, Formal Methods in Software and Systems Modeling.

[22]  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).