Advertisement

Relabelling in Graph Transformation

  • Annegret Habel
  • Detlef Plump
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2505)

Abstract

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

Keywords

Direct Derivation Graph Transformation Graph Grammar Injective Morphism Unique Morphism 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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
  3. 3.
    Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In Proc. Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, pages 1–69. Springer-Verlag, 1979.CrossRefGoogle Scholar
  4. 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
  5. 5.
    Hartmut Ehrig and Hans-Jörg Kreowski. Pushout-properties: An analysis of gluing constructions for graphs. Mathematische Nachrichten, 91:135–149, 1979.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Hartmut Ehrig, Hans-Jörg Kreowski, Andrea Maggiolo-Schettini, Barry K. Rosen, and Jozef Winkowski. Transformations of structures: an algebraic approach. Mathematical Systems Theory, 14:305–334, 1981.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 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
  8. 8.
    Annegret Habel, Jürgen Müller, and Detlef Plump. Double-pushout graph transformation revisited. Mathematical Structures in Computer Science, 11(5):637–688, 2001.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 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. 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
  11. 11.
    Barry K. Rosen. Deriving graphs from graphs by applying a production. Acta Informatica, 4:337–357, 1975.zbMATHCrossRefGoogle Scholar
  12. 12.
    Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Annegret Habel
    • 1
  • Detlef Plump
    • 2
  1. 1.Fachbereich InformatikUniversität OldenburgOldenburgGermany
  2. 2.Department of Computer ScienceThe University of YorkYorkUK

Personalised recommendations