{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:43:21Z","timestamp":1749728601776},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_15","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:18:40Z","timestamp":1408756720000},"page":"179-194","source":"Crossref","is-referenced-by-count":12,"title":["Termination Analysis for Graph Transformation Systems"],"prefix":"10.1007","author":[{"given":"H. J. Sander","family":"Bruggink","sequence":"first","affiliation":[]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[]},{"given":"Hans","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/363911.363914","volume":"22","author":"U. A\u00dfmann","year":"2000","unstructured":"A\u00dfmann, U.: Graph rewrite systems for program optimization. ACM Transactions on Programming Languages and Systems\u00a022(4), 583\u2013637 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bottoni, P., Hoffman, K., Presicce, F.P., Taentzer, G.: High-level replacement units and their termination properties. Journal of Visual Languages and Computing (2005)","DOI":"10.1016\/j.jvlc.2005.07.001"},{"key":"15_CR3","unstructured":"Bruggink, H.J.S.: Towards a systematic method for proving termination of graph transformation systems. In: Proceedings of GT-VC 2007 (2007)"},{"issue":"3\/4","key":"15_CR4","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. Fundamenta Informaticae\u00a026(3\/4), 241\u2013265 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol.\u00a01, World Scientific (1997)","DOI":"10.1142\/9789812384720_0003"},{"key":"15_CR6","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.\u00a03442, pp. 49\u201363. Springer, Heidelberg (2005)"},{"issue":"3-4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00200-004-0162-8","volume":"15","author":"A. Geser","year":"2004","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting. Applicable Algebra in Engineering, Communication and Computing\u00a015(3-4), 149\u2013171 (2004)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"15_CR8","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.\u00a05117, pp. 202\u2013216. Springer, Heidelberg (2008)"},{"issue":"2","key":"15_CR9","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. Fundementa Informaticae\u00a033(2), 201\u2013209 (1998)","journal-title":"Fundementa Informaticae"},{"key":"15_CR10","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.\u00a04178, pp. 260\u2013274. Springer, Heidelberg (2006)"},{"key":"15_CR11","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. Fundementa Informaticae\u00a024, 89\u2013105 (1995)","journal-title":"Fundementa Informaticae"},{"key":"15_CR12","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.\u00a08560, pp. 476\u2013490. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T16:39:26Z","timestamp":1598200766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}