Unfolding of Double-Pushout Graph Grammars is a Coreflection

In a recent paper, mimicking Winskel’s construction for Petri nets, a concurrent semantics for (double-pushout) DPO graph grammars has been provided by showing that each graph grammar can be unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible computations of the original grammar.

[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.  The Category of Typed Graph Grammars and its Adjunctions with Categories , 1994, TAGT.

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

[5]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

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

[7]  Ugo Montanari,et al.  Concatenable Graph Processes: Relating Processes and Derivation Traces , 1998, ICALP.

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

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

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

[11]  Leila Ribeiro,et al.  Parallel composition and unfolding semantics of graph grammars , 1996 .

[12]  G. Michele Pinna,et al.  On the Nature of Events: Another Perspective in Concurrency , 1995, Theor. Comput. Sci..

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

[14]  Ugo Montanari,et al.  On the semantics of place/transition Petri nets , 1997, Mathematical Structures in Computer Science.

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

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

[17]  Andrea Corradini,et al.  Concurrent Graph and Term Graph Rewriting , 1996, CONCUR.