Transformations of Graph Grammars

The notion of multilevel graph representations, where parts of graphs are not visible and the information can be restored via the explicit application of productions, and the corresponding extension of the classical double pushout approach is generalized to the algebraic theory of graph grammars and to the rewriting of these grammars, at the global level by defining High Level Replacement Systems where the productions consist of grammars and grammar morphisms, and at the local level where standard productions are used to rewrite both the initial graph and the productions of a grammar.

[1]  Kim Marriott,et al.  Declarative specification of visual languages , 1990, Proceedings of the 1990 IEEE Workshop on Visual Languages.

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

[3]  Hartmut Ehrig,et al.  Canonical Derivaitons for High-Level Replacement Systems , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[4]  Francesco Parisi-Presicce Single vs. Double Pushout Derivations of Graphs , 1992, WG.

[5]  Annegret Habel,et al.  Amalgamation of Graph Transformations with Applications to Synchronization , 1985, TAPSOFT, Vol.1.

[6]  Francesco Parisi-Presicce,et al.  Multilevel Graph Grammars , 1994, WG.

[7]  Eric J. Golin,et al.  The specification of visual language syntax , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

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

[9]  Joost Engelfriet,et al.  Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.