Relabelling in Graph Transformation
- 529 Downloads
The traditional double-pushout approach to graph transformation does not allow to change node labels in an arbitrary context. We propose a simple solution to this problem, namely to use rules with partially labelled interface graphs and to match rules injectively. In  we have shown that injective matching makes the double-pushout approach more expressive, and here we further generalise that approach. Besides solving the relabelling problem, our framework allows to write rules with partially labelled left-hand sides which are equivalent to (possibly infinite) sets of rules in the traditional setting. Unlike previous work on rules with partially labelled graphs, we do not need any labelling condition on matching morphisms, nor do we exclude node merging rules.
KeywordsDirect Derivation Graph Transformation Graph Grammar Injective Morphism Unique Morphism
Unable to display preview. Download preview PDF.
- 1.Michael R. Berthold, Ingrid Fischer, and Manuel Koch. Attributed graph transformation with partial attribution. In Proc. Joint APPLIGRAPH/GETGRATS Worshop on Graph Transformation Systems (GRATRA 2000), pages 171–178, 2000.Google Scholar
- 2.Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, Reiko Heckel, and Michael Löwe. Algebraic approaches to graph transformation— Part I: Basic concepts and double pushout approach. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, chapter 3, pages 163–245. World Scientific, 1997.Google Scholar
- 4.Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski, and Grzegorz Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages, and Tools. World Scientific, 1999.Google Scholar
- 7.Hartmut Ehrig, Hans-Jörg Kreowski, Ugo Montanari, and Grzegorz Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 3: Concurrency, Parallelism, and Distribution. World Scientific, 1999.Google Scholar
- 9.Francesco Parisi-Presicce, Hartmut Ehrig, and Ugo Montanari. Graph rewriting with unification and composition. In Proc. Graph-Grammars and Their Application to Computer Science, volume 291 of Lecture Notes in Computer Science, pages 496–514. Springer-Verlag, 1987.Google Scholar
- 10.Detlef Plump. Term graph rewriting. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 1, pages 3–61. World Scientific, 1999.Google Scholar
- 12.Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, 1997.Google Scholar