{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:59:36Z","timestamp":1771264776249,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319753959","type":"print"},{"value":"9783319753966","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75396-6_13","type":"book-chapter","created":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T21:33:53Z","timestamp":1517866433000},"page":"231-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Modular Termination of Graph Transformation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1148-822X","authenticated-orcid":false,"given":"Detlef","family":"Plump","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"13_CR2","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)"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.entcs.2008.04.072","volume":"213","author":"HJS Bruggink","year":"2008","unstructured":"Bruggink, H.J.S.: Towards a systematic method for proving termination of graph transformation systems. Electron. Notes Theor. Comput. Sci. 213(1), 23\u201338 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2008.04.072","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-319-21145-9_4","volume-title":"Graph Transformation","author":"HJS Bruggink","year":"2015","unstructured":"Bruggink, H.J.S., K\u00f6nig, B., Nolte, D., Zantema, H.: Proving termination of graph transformation systems using weighted type graphs over semirings. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 52\u201368. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21145-9_4"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-662-44602-7_15","volume-title":"Theoretical Computer Science","author":"HJS Bruggink","year":"2014","unstructured":"Bruggink, H.J.S., K\u00f6nig, B., Zantema, H.: Termination analysis for graph transformation systems. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 179\u2013194. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44602-7_15"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, Chap. 5. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/3-540-10843-2_36","volume-title":"Automata, Languages and Programming","author":"N Dershowitz","year":"1981","unstructured":"Dershowitz, N.: Termination of linear rewriting systems (preliminary version). In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 448\u2013458. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10843-2_36"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 45, pp. 284\u2013293. Springer, Heidelberg (1976). https:\/\/doi.org\/10.1007\/3-540-07854-1_188"},{"key":"13_CR9","unstructured":"Ehrig, H., Rosen, B.K.: Commutativity of independent transformations on complex objects. Research Report RC 6251. IBM Thomas J. Watson Research Center, Yorktown Heights (1976)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013875","volume-title":"Hyperedge Replacement: Grammars and Languages","author":"A Habel","year":"1992","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0013875"},{"issue":"5","key":"13_CR11","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. Math. Struct. Comput. Sci. 11(5), 637\u2013688 (2001). https:\/\/doi.org\/10.1017\/S0960129501003425","journal-title":"Math. Struct. Comput. Sci."},{"issue":"5","key":"13_CR12","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1051\/ita\/1991250504451","volume":"25","author":"B Hoffmann","year":"1991","unstructured":"Hoffmann, B., Plump, D.: Implementing term rewriting by jungle evaluation. RAIRO Theor. Inform. Appl. 25(5), 445\u2013472 (1991). https:\/\/doi.org\/10.1051\/ita\/1991250504451","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-72044-9_11","volume-title":"Recent Trends in Algebraic Development Techniques","author":"I Hristakiev","year":"2017","unstructured":"Hristakiev, I., Plump, D.: Towards critical pair analysis for the graph programming language GP 2. In: James, P., Roggenbach, M. (eds.) WADT 2016. LNCS, vol. 10644, pp. 153\u2013169. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72044-9_11"},{"issue":"1\u20132","key":"13_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(98)00079-6","volume":"208","author":"MRK Krishna Rao","year":"1998","unstructured":"Krishna Rao, M.R.K.: Modular aspects of term graph rewriting. Theor. Comput. Sci. 208(1\u20132), 59\u201386 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(98)00079-6","journal-title":"Theor. Comput. Sci."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-54317-1_100","volume-title":"Conditional and Typed Rewriting Systems","author":"D Plump","year":"1991","unstructured":"Plump, D.: Implementing term rewriting by graph reduction: termination of combined systems. In: Kaplan, S., Okada, M. (eds.) CTRS 1990. LNCS, vol. 516, pp. 307\u2013317. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54317-1_100"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-60618-1_68","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Plump","year":"1995","unstructured":"Plump, D.: On termination of graph rewriting. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 88\u2013100. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60618-1_68"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/BFb0029989","volume-title":"Mathematical Foundations of Computer Science 1997","author":"D Plump","year":"1997","unstructured":"Plump, D.: Simplification orders for term graph rewriting. In: Pr\u00edvara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 458\u2013467. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0029989"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.3233\/FI-1998-33204","volume":"33","author":"D Plump","year":"1998","unstructured":"Plump, D.: Termination of graph rewriting is undecidable. Fundam. Inform. 33(2), 201\u2013209 (1998). https:\/\/doi.org\/10.3233\/FI-1998-33204","journal-title":"Fundam. Inform."},{"key":"13_CR19","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":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11601548_16","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"D Plump","year":"2005","unstructured":"Plump, D.: 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. LNCS, vol. 3838, pp. 280\u2013308. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11601548_16"},{"issue":"1","key":"13_CR21","doi-asserted-by":"publisher","first-page":"38","DOI":"10.23638\/LMCS-13(1:11)2017","volume":"13","author":"D Sabel","year":"2017","unstructured":"Sabel, D., Zantema, H.: Termination of cycle rewriting by transformation and matrix interpretation. Log. Methods Comput. Sci. 13(1), 38 (2017). https:\/\/doi.org\/10.23638\/LMCS-13(1:11)2017","journal-title":"Log. Methods Comput. Sci."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y Toyama","year":"1987","unstructured":"Toyama, Y.: Counterexamples to termination for the direct sum of term rewriting systems. Inf. Process. Lett. 25, 141\u2013143 (1987). https:\/\/doi.org\/10.1016\/0020-0190(87)90122-0","journal-title":"Inf. Process. Lett."},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-319-08918-8_33","volume-title":"Rewriting and Typed Lambda Calculi","author":"H Zantema","year":"2014","unstructured":"Zantema, H., K\u00f6nig, B., Bruggink, H.J.S.: Termination of cycle rewriting. In: Dowek, G. (ed.) RTA-TLCA 2014. LNCS, vol. 8560, pp. 476\u2013490. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08918-8_33"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation, Specifications, and Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75396-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T05:18:07Z","timestamp":1570684687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-75396-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319753959","9783319753966"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75396-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}