Relabelling in graph transformation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2505, Issue , 2002, Pages 135-147

  Habel, Annegret ^a   Plump, Detlef ^b  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS;

DOUBLE PUSHOUT APPROACHES; GRAPH TRANSFORMATION; MORPHISMS; RELABELLING;

GRAPH THEORY;

EID: 35048870358     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45832-8_12     Document Type: Conference Paper

References (12)

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.
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.
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.
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.
5. Hartmut Ehrig and Hans-Jörg Kreowski. Pushout-properties: An analysis of gluing constructions for graphs. Mathematische Nachrichten, 91:135–149, 1979.
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.
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.
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.
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.
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.
11. Barry K. Rosen. Deriving graphs from graphs by applying a production. Acta Informatica, 4:337–357, 1975.
12. Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, 1997.