Algebraic Approach to Graph Transformation Based on Single Pushout Derivations

The Berlin approach to graph transformation, which uses double pushout derivations in the category of graphs and total graph morphisms, is modified using single pushout derivations in the category of graphs and partial graph morphisms. It is shown that the single pushout approach generalizes the classical approach in the sense that all double pushout derivations correspond to single pushout transformations but not vice versa.

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

[2]  Michael Löwe,et al.  Risiken polizeilicher Datenverarbeitung , 1987, FIFF Jahrestagung.

[3]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.

[4]  Annegret Habel,et al.  Amalgamation of Graph Transformations: A Synchronization Mechanism , 1987, J. Comput. Syst. Sci..

[5]  Hartmut Ehrig,et al.  Graph rewriting with unification and composition , 1986, Graph-Grammars and Their Application to Computer Science.

[6]  Pierre Lescanne,et al.  Algebraic and Logic Programming , 1988, Lecture Notes in Computer Science.

[7]  Michael Löwe,et al.  Implementing Algebraic Specifications by Graph Transformation Systems , 1991, J. Inf. Process. Cybern..

[8]  Grzegorz Rozenberg.  An introduction to the NLC way of rewriting graphs , 1986, Graph-Grammars and Their Application to Computer Science.

[9]  Berthold Hoffmann,et al.  Jungle Evaluation for Efficient Term Rewriting , 1988, ALP.

[10]  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.

[11]  Hartmut Ehrig.  Distributed Parallelism of Graph Transformations , 1987, WG.

[12]  Richard Kennaway.  On "On Graph Rewritings" , 1987, Theor. Comput. Sci..

[13]  Hartmut Ehrig,et al.  From Graph Grammars to High Level Replacement Systems , 1990, Graph-Grammars and Their Application to Computer Science.

[14]  Hartmut Ehrig,et al.  Graph Grammars with Application Conditions , 1986 .

[15]  Jean-Claude Raoult,et al.  On graph rewritings , 1984, Bull. EATCS.

[16]  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.

[17]  Francesco Parisi-Presicce,et al.  Modular System Design Applying Graph Grammars Techniques , 1989, ICALP.

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

[19]  Peter Padawitz,et al.  Graph Grammars and Operational Semantics , 1978, Theor. Comput. Sci..