Concurrent Graph and Term Graph Rewriting

Graph Rewriting Systems are a powerful formalism for the specification of parallel and distributed systems, and the corresponding theory is rich of results concerning parallelism and concurrency. I will review the main results of the theory of concurrency for the algebraic approach to graph rewriting, emphasizing the relationship with the theory of Petri nets. In fact, graph rewriting systems can be regarded as a proper generalization of Petri nets, where the current state of a system is described by a graph instead of by a collection of tokens. Recently, this point of view allowed for the generalization to graph rewriting of some interesting results and constructions of the concurrent semantics of nets, including processes, unfoldings, and categorical semantics based on pair of adjoint functors.

[1]  José Meseguer,et al.  On the Semantics of Petri Nets , 1992, CONCUR.

[2]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[3]  Hartmut Ehrig,et al.  Graph-Grammars and Their Application to Computer Science and Biology , 1978, Lecture Notes in Computer Science.

[4]  Georg Schied.  On Relating Rewriting Systems and Graph Grammars to Event Structures , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[5]  Glynn Winskel,et al.  An introduction to event structures , 1988, REX Workshop.

[6]  Ugo Montanari,et al.  A model for distributed systems based on graph rewriting , 1987, JACM.

[7]  Grzegorz Rozenberg,et al.  Computation Graphs for Actor Grammars , 1993, J. Comput. Syst. Sci..

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

[9]  Reiko Heckel,et al.  A compositional approach to structuring and refinement of typed graph grammars , 1995, SEGRAGRA.

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

[11]  David Clark,et al.  Event Structures and Non-Orthogonal Term Graph Rewriting , 1996, Math. Struct. Comput. Sci..

[12]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[13]  David Clark,et al.  Some properties of non-orthogonal term graph rewriting systems , 1995, Electron. Notes Theor. Comput. Sci..

[14]  Maciej Koutny,et al.  Invariant Semantics of Nets with Inhibitor Arcs , 1991, CONCUR.

[15]  M. J. Plasmeijer,et al.  Term graph rewriting: theory and practice , 1993 .

[16]  Jack C. Wileden,et al.  Relationships Between Graph Grammars and the Design and Analysis of Concurrent Software , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[17]  Hartmut Ehrig,et al.  Aspects of concurrency in graph grammars , 1982, Graph-Grammars and Their Application to Computer Science.

[18]  Jean-Jacques Lévy,et al.  Computations in Orthogonal Rewriting Systems, II , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[19]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1982, Lecture Notes in Computer Science.

[20]  Hartmut Ehrig,et al.  An Event Structure Semantics for Graph Grammars with Parallel Productions , 1994, TAGT.

[21]  Joost Engelfriet,et al.  Node Replacement Graph Grammars , 1997, Handbook of Graph Grammars.

[22]  Michael Löwe,et al.  Algebraic Approach to Single-Pushout Graph Transformation , 1993, Theor. Comput. Sci..

[23]  Wolfgang Reisig.  A Graph Grammar Representation of Non-Sequential Processes , 1980, WG.

[24]  Glynn Winskel,et al.  Relationships between Models of Concurency , 1993 .

[25]  Hartmut Ehrig,et al.  Tutorial introduction to the algebraic approach of graph grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[26]  Hartmut Ehrig,et al.  Abstract Graph Derivations in the Double Pushout Approach , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[27]  Hans-Jörg Kreowski,et al.  Is parallelism already concurrency? Part 1: Derivations in graph grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[28]  Annegret Habel,et al.  Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.

[29]  Hans-Jörg Kreowski,et al.  A Comparison Between Petri-Nets and Graph Grammars , 1980, WG.

[30]  Manfred Nagl.  Graph-Grammatiken: Theorie, Anwendungen, Implementierung , 1979 .

[31]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[32]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[33]  Hartmut Ehrig,et al.  Note on standard representation of graphs and graph derivations , 1994 .

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

[35]  Grzegorz Rozenberg.  Behaviour of Elementary Net Systems , 1986 .

[36]  Dirk Janssens,et al.  ESM Systems and the Composition of Their Computations , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

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

[38]  Hartmut Ehrig,et al.  An Event Structure Semantics for Safe Graph Grammars , 1994, PROCOMET.

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

[40]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[41]  J. R. Kennaway,et al.  Event structures and orthogonal term graph rewriting , 1993 .

[42]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach , 1997, Handbook of Graph Grammars.

[43]  Hans-Jörg Kreowski,et al.  Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[44]  Leila Ribeiro,et al.  Concurrent derivations as single pushout graph grammar processes , 1995, Electron. Notes Theor. Comput. Sci..

[45]  Reiko Heckel,et al.  Horizontal and vertical structuring of typed graph transformation systems , 1996, Mathematical Structures in Computer Science.

[46]  Andrea Corradini,et al.  Concurrent computing: from Petri nets to graph grammars , 1995, SEGRAGRA.

[47]  Glynn Winskel,et al.  Relationships Between Models of Concurrency , 1993, REX School/Symposium.

[48]  Hartmut Ehrig,et al.  The Category of Typed Graph Grammars and its Adjunctions with Categories , 1994, TAGT.

[49]  Grzegorz Rozenberg,et al.  Petri nets and their relation to graph grammars , 1982, Graph-Grammars and Their Application to Computer Science.

[50]  Hans Jürgen Schneider,et al.  On Categorical Graph Grammars Integrating Structural Transformations and Operations on Labels , 1993, Theor. Comput. Sci..

[51]  Hans-Jörg Kreowski,et al.  Net Processes Correspond to Derivation Processes in Graph Grammars , 1986, Theor. Comput. Sci..

[52]  Richard Banach.  DPO rewriting and abstract semantics via opfibrations , 1995, Electron. Notes Theor. Comput. Sci..

[53]  Manfred Nagl.  Set theoretic approaches to graph grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[54]  C. Petri.  Kommunikation mit Automaten , 1962 .

[55]  Hans Jürgen Schneider,et al.  Describing Distributed Systems by Categorical Graph Grammars , 1989, WG.

[56]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[57]  Francesca Rossi,et al.  Synchronized Composition of Graph Grammar Productions , 1994, TAGT.

[58]  Tom Mens,et al.  Abstract Semantics for ESM Systems , 1996, Fundam. Informaticae.

[59]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[60]  Maciej Koutny,et al.  Structure of Concurrency , 1991, Theor. Comput. Sci..