{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:43:23Z","timestamp":1749728603319,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319211442"},{"type":"electronic","value":"9783319211459"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21145-9_4","type":"book-chapter","created":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T10:55:04Z","timestamp":1437044104000},"page":"52-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings"],"prefix":"10.1007","author":[{"given":"H. J. Sander","family":"Bruggink","sequence":"first","affiliation":[]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Nolte","sequence":"additional","affiliation":[]},{"given":"Hans","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,17]]},"reference":[{"key":"4_CR1","unstructured":"Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB standard - version 2.0. In: Proceedings of the 8th International Workshop on Satisfiability Modulo Theories (SMT 2010), Edinburgh, Scotland, July 2010"},{"volume-title":"Term Rewriting Systems","year":"2003","key":"4_CR2","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term Rewriting Systems. Cambridge University Press, London (2003)"},{"issue":"6","key":"4_CR3","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jvlc.2005.07.001","volume":"16","author":"P Bottoni","year":"2005","unstructured":"Bottoni, P., Hoffman, K., Presicce, F.P., Taentzer, G.: High-level replacement units and their termination properties. J. Vis. Lang. Comput. 16(6), 485\u2013507 (2005)","journal-title":"J. Vis. Lang. Comput."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bruggink, H.J.S., K\u00f6nig, B., Nolte, D., Zantema, H.: Proving termination of graph transformation systems using weighted type graphs over semirings (2015). arXiv:1505.01695","DOI":"10.1007\/978-3-319-21145-9_4"},{"key":"4_CR5","unstructured":"Bruggink, H.J.S.: Grez user manual (2015). www.ti.inf.uni-due.de\/research\/tools\/grez"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"3\/4","key":"4_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundam. Informaticae 26(3\/4), 241\u2013265 (1996)","journal-title":"Fundam. Informaticae"},{"key":"4_CR8","series-title":"Foundations","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-part I: basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1, pp. 163\u2013245. World Scientific, Singapore (1997)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-31984-9_5","volume-title":"Fundamental Approaches to Software Engineering","author":"H Ehrig","year":"2005","unstructured":"Ehrig, H., Ehrig, K., de Lara, J., Taentzer, G., Varr\u00f3, D., Varr\u00f3-Gyapay, S.: Termination criteria for model transformation. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 49\u201363. Springer, Heidelberg (2005)"},{"issue":"2\u20133","key":"4_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10817-007-9087-9","volume":"40","author":"J Endrullis","year":"2008","unstructured":"Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. J. Autom. Reasoning 40(2\u20133), 195\u2013220 (2008)","journal-title":"J. Autom. Reasoning"},{"key":"4_CR11","unstructured":"Geser, A.: Relative termination. Ph.D. thesis, Universit\u00e4t Passau (1990)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11805618_25","volume-title":"Term Rewriting and Applications","author":"D Hofbauer","year":"2006","unstructured":"Hofbauer, D., Waldmann, J.: Termination of string rewriting with matrix interpretations. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 328\u2013342. Springer, Heidelberg (2006)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-70590-1_14","volume-title":"Rewriting Techniques and Applications","author":"A Koprowski","year":"2008","unstructured":"Koprowski, A., Waldmann, J.: Arctic termination..below zero. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 202\u2013216. Springer, Heidelberg (2008)"},{"key":"4_CR14","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)"},{"issue":"2","key":"4_CR15","doi-asserted-by":"crossref","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. Informaticae 33(2), 201\u2013209 (1998)","journal-title":"Fundam. Informaticae"},{"key":"4_CR16","unstructured":"Sabel, D., Zantema, H.: Transforming cycle rewriting into string rewriting. In: Proceedings of RTA 2015, LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/11841883_19","volume-title":"Graph Transformations","author":"D Varr\u00f3","year":"2006","unstructured":"Varr\u00f3, D., Varr\u00f3\u2013Gyapay, S., Ehrig, H., Prange, U., Taentzer, G.: Termination analysis of model transformations by petri nets. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 260\u2013274. Springer, Heidelberg (2006)"},{"issue":"1\/2","key":"4_CR18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","volume":"24","author":"H Zantema","year":"1995","unstructured":"Zantema, H.: Termination of term rewriting by semantic labelling. Fundam. Informaticae 24(1\/2), 89\u2013105 (1995)","journal-title":"Fundam. Informaticae"},{"key":"4_CR19","unstructured":"Zantema, H.: Termination. In: Bezem, M., Klop, J.W., de Vrijer, R. (eds.) Term Rewriting Systems, Chap. 6, pp. 181\u2013259. Cambridge University Press, London (2003)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21145-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:39:18Z","timestamp":1676972358000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21145-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319211442","9783319211459"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21145-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}