Skip to main content
SpringerLink
Log in
Book cover

Processes, Terms and Cycles: Steps on the Road to Infinity pp 280–308Cite as

Confluence of Graph Transformation Revisited

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3838))

Abstract

It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string rewriting systems. Critical pairs are introduced to hypergraph rewriting, a generalisation of graph rewriting, where it turns out that the mere existence of common reducts for all critical pairs of a graph rewriting system does not imply local confluence. A Critical Pair Lemma for hypergraph rewriting is then established which guarantees local confluence if each critical pair of a system has joining derivations that are compatible in that they map certain nodes to the same nodes in the common reduct.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adámek, J., Herrlich, H., Strecker, G.: Abstract and Concrete Categories. Wiley, Chichester (1990)

    MATH  Google Scholar 

  2. Arnborg, S., Courcelle, B., Proskurowski, A., Seese, D.: An algebraic theory of graph reduction. Journal of the ACM 40(5), 1134–1164 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  3. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  4. Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  5. Bodlaender, H.L., de Fluiter, B.: Reduction algorithms for constructing solutions in graphs with small treewidth. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol. 1090, pp. 199–208. Springer, Heidelberg (1996)

    Google Scholar 

  6. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic approaches to graph transformation — Part I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1,ch.3, pp. 163–245. World Scientific, Singapore (1997)

    Chapter  Google Scholar 

  7. de Fluiter, B.: Algorithms for Graphs of Small Treewidth. Dissertation, Universiteit Utrecht (1997)

    Google Scholar 

  8. Ehrig, H.: Embedding theorems in the algebraic theory of graph-grammars. In: Karpinski, M. (ed.) FCT 1977. LNCS, vol. 56, pp. 245–255. Springer, Heidelberg (1977)

    Google Scholar 

  9. Ehrig, H.: Introduction to the algebraic theory of graph grammars. In: Ng, E.W., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol. 73, pp. 1–69. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

  10. Ehrig, H., Habel, A., Padberg, J., Prange, U.: Adhesive high-level replacement categories and systems. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 144–160. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Ehrig, H., Kreowski, H.-J.: Parallelism of manipulations in multidimensional information structures. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol. 45, pp. 284–293. Springer, Heidelberg (1976)

    Google Scholar 

  12. Ehrig, H., Kreowski, H.-J.: Pushout-properties: An analysis of gluing constructions for graphs. Mathematische Nachrichten 91, 135–149 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ehrig, H., Kreowski, H.-J., Maggiolo-Schettini, A., Rosen, B.K., Winkowski, J.: Transformations of structures: an algebraic approach. Mathematical Systems Theory 14, 305–334 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  14. Ehrig, H., Prange, U., Taentzer, G.: Fundamental theory for typed attributed graph transformation. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 161–177. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Ermel, C., Rudolf, M., Taentzer, G.: The AGG approach: Language and environment. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 2, ch.14, pp. 551–603. World Scientific, Singapore (1999)

    Google Scholar 

  16. Farrow, R., Kennedy, K., Zucconi, L.: Graph grammars and global program data flow analysis. In: Proc. 17th Annual Symposium on Foundations of Computer Science, pp. 42–56. IEEE, Los Alamitos (1976)

    Google Scholar 

  17. Goguen, J.A., Thatcher, J.W., Wagner, E.G.: An initial algebra approach to the specification, correctness, and implementation of abstract data types. In: Yeh, R.T. (ed.) Current Trends in Programming Methodology, Volume 4: Data Structuring, pp. 80–149. Prentice-Hall, Englewood Cliffs (1978)

    Google Scholar 

  18. Habel, A., Müller, J., Plump, D.: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11(5), 637–688 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  19. Heckel, R., Küster, J.M., Taentzer, G.: Confluence of typed attributed graph transformation systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 161–176. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM 27(4), 797–821 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  21. Kapur, D., Narendran, P., Otto, F.: On ground-confluence of term rewriting systems. Information and Computation 86, 14–31 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  22. K̇nuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebras, pp. 263–297. Pergamon Press, Oxford (1970)

    Google Scholar 

  23. Kreowski, H.-J.: Manipulationen von Graphmanipulationen. Doctoral dissertation, Technische Universität Berlin. In: German (1977)

    Google Scholar 

  24. Löwe, M., Müller, J.: 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, pp. 71–77. Technical report B-19, Universitat de les Illes Balears (1995)

    Google Scholar 

  25. Newman, M.H.A.: On theories with a combinatorial definition of “equivalence”. Annals of Mathematics 43(2), 223–243 (1942)

    Article  MathSciNet  Google Scholar 

  26. Okada, Y., Hayashi, M.: Graph rewriting systems and their application to network reliability analysis. In: Schmidt, G., Berghammer, R. (eds.) WG 1991. LNCS, vol. 570. Springer, Heidelberg (1992)

    Google Scholar 

  27. Plump, D.: Hypergraph rewriting: Critical pairs and undecidability of confluence. In: Sleep, R., Plasmeijer, R., van Eekelen, M. (eds.) Term Graph Rewriting: Theory and Practice, vol. ch. 15, pp. 201–213. John Wiley, Chichester (1993)

    Google Scholar 

  28. Plump, D.: Computing by Graph Rewriting. Habilitation thesis, Universität Bremen, Fachbereich Mathematik und Informatik (1999)

    Google Scholar 

  29. Plump, D., Steinert, S.: Towards graph programs for graph algorithms. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 128–143. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  30. Raoult, J.-C.: On graph rewritings. Theoretical Computer Science 32, 1–24 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  31. Rekers, J., Schürr, A.: Defining and parsing visual languages with layered graph grammars. Journal of Visual Languages and Computing 8(1), 27–55 (1997)

    Article  Google Scholar 

  32. Rosen, B.K.: Deriving graphs from graphs by applying a production. Acta Informatica 4, 337–357 (1975)

    Article  MATH  Google Scholar 

  33. Rozenberg, G., Salomaa, A.: Cornerstones of Undecidability. Prentice-Hall, Englewood Cliffs (1994)

    MATH  Google Scholar 

  34. Schürr, A., Winter, A., Zündorf, A.: The PROGRES approach: Language and environment. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.  2, ch. 13, pp. 487–550. World Scientific, Singapore (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of York, York, YO10 5DD, United Kingdom

    Detlef Plump

Authors
  1. Detlef Plump
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Innsbruck, Austria

    Aart Middeldorp

  2. Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands

    Vincent van Oostrom

  3. Department of Theoretical Computer Science, Vrije Universiteit, De Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Femke van Raamsdonk

  4. VU Vrije Universiteit Amsterdam,  

    Roel de Vrijer

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Plump, D. (2005). Confluence of Graph Transformation Revisited. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds) Processes, Terms and Cycles: Steps on the Road to Infinity. Lecture Notes in Computer Science, vol 3838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11601548_16

Download citation

  • DOI: https://doi.org/10.1007/11601548_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30911-6

  • Online ISBN: 978-3-540-32425-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation