Confluence of graph transformation revisited

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

Volumn 3838 LNCS, Issue , 2005, Pages 280-308

  Plump, Detlef ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; CONFORMAL MAPPING; NUMERICAL METHODS; PROBLEM SOLVING; THEOREM PROVING;

GRAPH REWRITING SYSTEMS; GRAPH TRANSFORMATION; HYPERGRAPHS;

GRAPH THEORY;

EID: 33750916314     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11601548_16     Document Type: Article

References (34)

1. Jiří Adámek, Horst Herrlich, and George Strecker. Abstract and Concrete Categories. Wiley, 1990.
2. Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, and Detlef Seese. An algebraic theory of graph reduction. Journal of the ACM, 40(5): 1134-1164, 1993.
3. Franz Baader and Tobias Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
4. Marc Bezem, Jan Willem Klop, and Roei de Vrijer, editors. Term Rewriting Systems. Cambridge University Press, 2003.
5. Hans L. Bodlaender and Babette de Fluiter. Reduction algorithms for constructing solutions in graphs with small treewidth. In Proc. Computing and Combinatorics, volume 1090 of Lecture Notes in Computer Science, pages 199-208, 1996.
6. 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.
7. Babette de Fluiter. Algorithms for Graphs of Small Treewidth. Dissertation, Universiteit Utrecht, 1997.
8. Hartmut Ehrig. Embedding theorems in the algebraic theory of graph-grammars. In Proc. Fundamentals of Computation Theory, volume 56 of Lecture Notes in Computer Science, pages 245-255. Springer-Verlag, 1977.
9. 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.
10. Hartmut Ehrig, Annegret Habel, Julia Padberg, and Ulrike Prange. Adhesive high-level replacement categories and systems. In Proc. International Conference on Graph Transformation (ICGT 2004), volume 3256 of Lecture Notes in Computer Science, pages 144-160. Springer-Verlag, 2004.
11. Hartmut Ehrig and Hans-Jörg Kreowski. Parallelism of manipulations in multidimensional information structures. In Proc. Mathematical Foundations of Computer Science, volume 45 of Lecture Notes in Computer Science, pages 284-293. Springer-Verlag, 1976.
12. Hartmut Ehrig and Hans-Jörg Kreowski. Pushout-properties: An analysis of gluing constructions for graphs. Mathematische Nachrichten, 91:135-149, 1979.
13. 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.
14. Hartmut Ehrig, Ulrike Prange, and Gabriele Taentzer. Fundamental theory for typed attributed graph transformation. In Proc. International Conference on Graph Transformation (ICGT 2004), volume 3256 of Lecture Notes in Computer Science, pages 161-177. Springer-Verlag, 2004.
15. Claudia Ermel, Michael Rudolf, and Gabi Taentzer. The AGG approach: Language and environment. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 14, pages 551-603. World Scientific, 1999.
16. Rodney Farrow, Ken Kennedy, and Linda Zucconi. Graph grammars and global program data flow analysis. In Proc. 17th Annual Symposium on Foundations of Computer Science, pages 42-56. IEEE, 1976.
17. Joseph A. Goguen, Jim W. Thatcher, and Eric G. Wagner. An initial algebra approach to the specification, correctness, and implementation of abstract data types. In R. T. Yeh, editor, Current Trends in Programming Methodology, Volume 4: Data Structuring, pages 80-149. Prentice Hall, 1978.
18. Annegret Habel, Jürgen Müller, and Detlef Plump. Double-pushout graph transformation revisited. Mathematical Structures in Computer Science, 11(5):637-688, 2001.
19. Reiko Heckel, Jochen Malte Küster, and Gabi Taentzer. Confluence of typed attributed graph transformation systems. In Proc. International Conference on Graph Transformation (ICGT 2002), volume 2505 of Lecture Notes in Computer Science, pages 161-176. Springer-Verlag, 2002.
20. Gérard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797-821, 1980.
21. Deepak Kapur, Paliath Narendran, and Friedrich Otto. On ground-confluence of term rewriting systems. Information and Computation, 86:14-31, 1990.
22. Donald E. Knuth and Peter B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebras, pages 263-297. Pergamon Press, 1970.
23. Hans-Jörg Kreowski. Manipulationen von Graphmanipulationen. Doctoral dissertation, Technische Universität Berlin, 1977. In German.
24. Michael Löwe and Jürgen Müller. Critical pair analysis in single-pushout graph rewriting. In Gabriel Valiente Feruglio and Francesc Roselló Llompart, editors, Proc. Colloquium on Graph Transformation and its Application in Computer Science, pages 71-77. Technical report B-19, Universität de les Ules Balears, 1995.
25. M.H.A. Newman. On theories with a combinatorial definition of "equivalence". Annals of Mathematics, 43(2):223-243, 1942.
26. Yasuyoshi Okada and Masahiro Hayashi. Graph rewriting systems and their application to network reliability analysis. In Proc. Graph-Theoretic Concepts in Computer Science, volume 570 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
27. Detlef Plump. Hypergraph rewriting: Critical pairs and undecidability of confluence. In Ronan Sleep, Rinus Plasmeijer, and Marko van Eekelen, editors, Term Graph Rewriting: Theory and Practice, chapter 15, pages 201-213. John Wiley, 1993.
28. Detlef Plump. Computing by Graph Rewriting. Habilitation thesis, Universität Bremen, Fachbereich Mathematik und Informatik, 1999.
29. Detlef Plump and Sandra Steinert. Towards graph programs for graph algorithms. In Proc. Int. Conference on Graph Transformation (ICGT 2004), volume 3256 of Lecture Notes in Computer Science, pages 128-143. Springer-Verlag, 2004.
30. Jean-Claude Raoult. On graph rewritings. Theoretical Computer Science, 32:1-24, 1984.
31. Jan Rekers and Andy Schurr. Defining and parsing visual languages with layered graph grammars. Journal of Visual Languages and Computing, 8(1):27-55, 1997.
32. Barry K. Rosen. Deriving graphs from graphs by applying a production. Acta Informatica, 4:337-357, 1975.
33. Grzegorz Rozenberg and Arto Salomaa. Cornerstones of Undecidability. Prentice Hall, 1994.
34. Andy Schurr, Andreas Winter, and Albert Zündorf. The PROGRES approach: Language and environment. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 13, pages 487-550. World Scientific, 1999.