{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T17:56:29Z","timestamp":1769968589632,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540309116","type":"print"},{"value":"9783540324256","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11601548_16","type":"book-chapter","created":{"date-parts":[[2005,12,10]],"date-time":"2005-12-10T05:39:45Z","timestamp":1134193185000},"page":"280-308","source":"Crossref","is-referenced-by-count":32,"title":["Confluence of Graph Transformation Revisited"],"prefix":"10.1007","author":[{"given":"Detlef","family":"Plump","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Abstract and Concrete Categories","author":"J. Ad\u00e1mek","year":"1990","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.: Abstract and Concrete Categories. Wiley, Chichester (1990)"},{"issue":"5","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/174147.169807","volume":"40","author":"S. Arnborg","year":"1993","unstructured":"Arnborg, S., Courcelle, B., Proskurowski, A., Seese, D.: An algebraic theory of graph reduction. Journal of the ACM\u00a040(5), 1134\u20131164 (1993)","journal-title":"Journal of the ACM"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"16_CR4","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-61332-3_153","volume-title":"Computing and Combinatorics","author":"H.L. Bodlaender","year":"1996","unstructured":"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.\u00a01090, pp. 199\u2013208. Springer, Heidelberg (1996)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/9789812384720_0003","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation \u2014 Part I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01,ch.3, pp. 163\u2013245. World Scientific, Singapore (1997)"},{"key":"16_CR7","unstructured":"de\u00a0Fluiter, B.: Algorithms for Graphs of Small Treewidth. Dissertation, Universiteit Utrecht (1997)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-08442-8_91","volume-title":"Fundamentals of Computation Theory","author":"H. Ehrig","year":"1977","unstructured":"Ehrig, H.: Embedding theorems in the algebraic theory of graph-grammars. In: Karpinski, M. (ed.) FCT 1977. LNCS, vol.\u00a056, pp. 245\u2013255. Springer, Heidelberg (1977)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0025714","volume-title":"Graph-Grammars and Their Application to Computer Science and Biology","author":"H. Ehrig","year":"1979","unstructured":"Ehrig, H.: Introduction to the algebraic theory of graph grammars. In: Ng, E.W., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol.\u00a073, pp. 1\u201369. Springer, Heidelberg (1979)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-30203-2_12","volume-title":"Graph Transformations","author":"H. Ehrig","year":"2004","unstructured":"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.\u00a03256, pp. 144\u2013160. Springer, Heidelberg (2004)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/3-540-07854-1_188","volume-title":"Mathematical Foundations of Computer Science 1976","author":"H. Ehrig","year":"1976","unstructured":"Ehrig, H., Kreowski, H.-J.: Parallelism of manipulations in multidimensional information structures. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol.\u00a045, pp. 284\u2013293. Springer, Heidelberg (1976)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/mana.19790910111","volume":"91","author":"H. Ehrig","year":"1979","unstructured":"Ehrig, H., Kreowski, H.-J.: Pushout-properties: An analysis of gluing constructions for graphs. Mathematische Nachrichten\u00a091, 135\u2013149 (1979)","journal-title":"Mathematische Nachrichten"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01752403","volume":"14","author":"H. Ehrig","year":"1981","unstructured":"Ehrig, H., Kreowski, H.-J., Maggiolo-Schettini, A., Rosen, B.K., Winkowski, J.: Transformations of structures: an algebraic approach. Mathematical Systems Theory\u00a014, 305\u2013334 (1981)","journal-title":"Mathematical Systems Theory"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-30203-2_13","volume-title":"Graph Transformations","author":"H. Ehrig","year":"2004","unstructured":"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.\u00a03256, pp. 161\u2013177. Springer, Heidelberg (2004)"},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1142\/9789812815149_0014","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"C. Ermel","year":"1999","unstructured":"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.\u00a02, ch.14, pp. 551\u2013603. World Scientific, Singapore (1999)"},{"key":"16_CR16","first-page":"42","volume-title":"Proc. 17th Annual Symposium on Foundations of Computer Science","author":"R. Farrow","year":"1976","unstructured":"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\u201356. IEEE, Los Alamitos (1976)"},{"key":"16_CR17","first-page":"80","volume-title":"Current Trends in Programming Methodology, Volume 4: Data Structuring","author":"J.A. Goguen","year":"1978","unstructured":"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\u2013149. Prentice-Hall, Englewood Cliffs (1978)"},{"issue":"5","key":"16_CR18","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1017\/S0960129501003425","volume":"11","author":"A. Habel","year":"2001","unstructured":"Habel, A., M\u00fcller, J., Plump, D.: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science\u00a011(5), 637\u2013688 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45832-8_14","volume-title":"Graph Transformation","author":"R. Heckel","year":"2002","unstructured":"Heckel, R., K\u00fcster, 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.\u00a02505, pp. 161\u2013176. Springer, Heidelberg (2002)"},{"issue":"4","key":"16_CR20","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM\u00a027(4), 797\u2013821 (1980)","journal-title":"Journal of the ACM"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0890-5401(90)90023-B","volume":"86","author":"D. Kapur","year":"1990","unstructured":"Kapur, D., Narendran, P., Otto, F.: On ground-confluence of term rewriting systems. Information and Computation\u00a086, 14\u201331 (1990)","journal-title":"Information and Computation"},{"key":"16_CR22","first-page":"263","volume-title":"Computational Problems in Abstract Algebras","author":"D.E. K\u0307nuth","year":"1970","unstructured":"K\u0307nuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebras, pp. 263\u2013297. Pergamon Press, Oxford (1970)"},{"key":"16_CR23","unstructured":"Kreowski, H.-J.: Manipulationen von Graphmanipulationen. Doctoral dissertation, Technische Universit\u00e4t Berlin. In: German (1977)"},{"key":"16_CR24","unstructured":"L\u00f6we, M., M\u00fcller, J.: Critical pair analysis in single-pushout graph rewriting. In: Gabriel\u00a0Valiente Feruglio and Francesc\u00a0Rosell\u00f3 Llompart, editors, Proc. Colloquium on Graph Transformation and its Application in Computer Science, pp. 71\u201377. Technical report B-19, Universitat de les Illes Balears (1995)"},{"issue":"2","key":"16_CR25","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"Newman, M.H.A.: On theories with a combinatorial definition of \u201cequivalence\u201d. Annals of Mathematics\u00a043(2), 223\u2013243 (1942)","journal-title":"Annals of Mathematics"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Y. Okada","year":"1992","unstructured":"Okada, Y., Hayashi, M.: Graph rewriting systems and their application to network reliability analysis. In: Schmidt, G., Berghammer, R. (eds.) WG 1991. LNCS, vol.\u00a0570. Springer, Heidelberg (1992)"},{"key":"16_CR27","first-page":"201","volume-title":"Term Graph Rewriting: Theory and Practice","author":"D. Plump","year":"1993","unstructured":"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.\u00a0ch. 15, pp. 201\u2013213. John Wiley, Chichester (1993)"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Plump, D.: Computing by Graph Rewriting. Habilitation thesis, Universit\u00e4t Bremen, Fachbereich Mathematik und Informatik (1999)","DOI":"10.1142\/9789812815149_0001"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-30203-2_11","volume-title":"Graph Transformations","author":"D. Plump","year":"2004","unstructured":"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.\u00a03256, pp. 128\u2013143. Springer, Heidelberg (2004)"},{"key":"16_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(84)90021-5","volume":"32","author":"J.-C. Raoult","year":"1984","unstructured":"Raoult, J.-C.: On graph rewritings. Theoretical Computer Science\u00a032, 1\u201324 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"16_CR31","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jvlc.1996.0027","volume":"8","author":"J. Rekers","year":"1997","unstructured":"Rekers, J., Sch\u00fcrr, A.: Defining and parsing visual languages with layered graph grammars. Journal of Visual Languages and Computing\u00a08(1), 27\u201355 (1997)","journal-title":"Journal of Visual Languages and Computing"},{"key":"16_CR32","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF00289616","volume":"4","author":"B.K. Rosen","year":"1975","unstructured":"Rosen, B.K.: Deriving graphs from graphs by applying a production. Acta Informatica\u00a04, 337\u2013357 (1975)","journal-title":"Acta Informatica"},{"key":"16_CR33","volume-title":"Cornerstones of Undecidability","author":"G. Rozenberg","year":"1994","unstructured":"Rozenberg, G., Salomaa, A.: Cornerstones of Undecidability. Prentice-Hall, Englewood Cliffs (1994)"},{"key":"16_CR34","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1142\/9789812815149_0013","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. Sch\u00fcrr","year":"1999","unstructured":"Sch\u00fcrr, A., Winter, A., Z\u00fcndorf, 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.\u00a0\u00a02, ch.\u00a013, pp. 487\u2013550. World Scientific, Singapore (1999)"}],"container-title":["Lecture Notes in Computer Science","Processes, Terms and Cycles: Steps on the Road to Infinity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11601548_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:25:57Z","timestamp":1586611557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11601548_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309116","9783540324256"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11601548_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}