{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T04:05:55Z","timestamp":1749787555443,"version":"3.41.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031947056","type":"print"},{"value":"9783031947063","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-94706-3_1","type":"book-chapter","created":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:22:39Z","timestamp":1749727359000},"page":"3-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Termination of\u00a0Injective DPO Graph Rewriting Systems Using Subgraph Counting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8350-2748","authenticated-orcid":false,"given":"Qi","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"1_CR2","unstructured":"Barr, M., Wells, C.: Category theory for computing science (2. ed.). Prentice Hall international series in computer science, Prentice Hall (1995)"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Bottoni, P., Koch, M., Parisi-Presicce, F., Taentzer, G.: Termination of high-level replacement units with application to model transformation. In: Minas, M. (ed.) Proceedings of the Workshop on Visual Languages and Formal Methods, VLFM 2004, Rome, Italy, September 30, 2004. Electronic Notes in Theoretical Computer Science, vol.\u00a0127, pp. 71\u201386. Elsevier (2004). https:\/\/doi.org\/10.1016\/J.ENTCS.2004.08.048","DOI":"10.1016\/J.ENTCS.2004.08.048"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Bottoni, P., Parisi-Presicce, F.: A termination criterion for graph transformations with negative application conditions. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 30 (2010). https:\/\/doi.org\/10.14279\/TUJ.ECEASST.30.419","DOI":"10.14279\/TUJ.ECEASST.30.419"},{"key":"1_CR5","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. CoRR abs\/1505.01695 (2015), http:\/\/arxiv.org\/abs\/1505.01695","DOI":"10.1007\/978-3-319-21145-9_4"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Bruggink, H.J.S., K\u00f6nig, B., Zantema, H.: Termination analysis for graph transformation systems. In: D\u00edaz, J., Lanese, I., Sangiorgi, D. (eds.) Theoretical Computer Science - 8th IFIP TC 1\/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings. Lecture Notes in Computer Science, vol.\u00a08705, pp. 179\u2013194. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-662-44602-7_15","DOI":"10.1007\/978-3-662-44602-7_15"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Contejean, E., Courtieu, P., Forest, J., Pons, O., Urbain, X.: Automated certified proofs with CiME3. In: Schmidt-Schau\u00df, M. (ed.) Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, May 30 - June 1, 2011, Novi Sad, Serbia. LIPIcs, vol.\u00a010, pp. 21\u201330. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2011). https:\/\/doi.org\/10.4230\/LIPICS.RTA.2011.21","DOI":"10.4230\/LIPICS.RTA.2011.21"},{"key":"1_CR8","doi-asserted-by":"crossref","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 Transformations, Volume 1: Foundations, pp. 163\u2013246. World Scientific (1997)","DOI":"10.1142\/9789812384720_0003"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Courtieu, P., Rieg, L., Tixeuil, S., Urbain, X.: Certified universal gathering in $${R}^2$$ for oblivious mobile robots. In: Gavoille, C., Ilcinkas, D. (eds.) Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings. Lecture Notes in Computer Science, vol.\u00a09888, pp. 187\u2013200. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_14","DOI":"10.1007\/978-3-662-53426-7_14"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Endrullis, J., Overbeek, R.: Generalized weighted type graphs for termination of graph transformation systems. In: Harmer, R., Kosiol, J. (eds.) Graph Transformation - 17th International Conference, ICGT 2024, Held as Part of STAF 2024, Enschede, The Netherlands, July 10-11, 2024, Proceedings. Lecture Notes in Computer Science, vol. 14774, pp. 39\u201358. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-64285-2_3","DOI":"10.1007\/978-3-031-64285-2_3"},{"key":"1_CR11","unstructured":"Geser, A.: Relative Termination. Ph.D. thesis, University of Passau, Germany (1990). http:\/\/vts.uni-ulm.de\/docs\/2012\/8146\/vts_8146_11884.pdf"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Giesl, J., et al.: Proving termination of programs automatically with AProVE. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 19-22, 2014. Proceedings. Lecture Notes in Computer Science, vol.\u00a08562, pp. 184\u2013191. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-08587-6_13","DOI":"10.1007\/978-3-319-08587-6_13"},{"issue":"5","key":"1_CR13","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."},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Harrison, J., Urban, J., Wiedijk, F.: History of interactive theorem proving. In: Siekmann, J.H. (ed.) Computational Logic, Handbook of the History of Logic, vol.\u00a09, pp. 135\u2013214. Elsevier (2014). https:\/\/doi.org\/10.1016\/B978-0-444-51624-4.50004-6","DOI":"10.1016\/B978-0-444-51624-4.50004-6"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Heiser, G., Andronick, J., Elphinstone, K., Klein, G., Kuz, I., Ryzhyk, L.: The road to trustworthy systems. In: Xu, S., Asokan, N., Sadeghi, A. (eds.) Proceedings of the fifth ACM Workshop on Scalable Trusted Computing, STC@CCS 2010, Chicago, IL, USA, October 4, 2010, pp. 3\u201310. ACM (2010)","DOI":"10.1145\/1867635.1867638"},{"key":"1_CR16","unstructured":"Klop, J.: Term rewriting systems: A tutorial. Bulletin of the European Association for Theoretical Computer Science (1987)"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"K\u00f6nig, B., Nolte, D., Padberg, J., Rensink, A.: A tutorial on graph transformation. In: Heckel, R., Taentzer, G. (eds.) Graph Transformation, Specifications, and Nets - In Memory of Hartmut Ehrig. Lecture Notes in Computer Science, vol. 10800, pp. 83\u2013104. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-75396-6_5","DOI":"10.1007\/978-3-319-75396-6_5"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. In: Malkhi, D. (ed.) Concurrency: the Works of Leslie Lamport, pp. 203\u2013226. ACM (2019). https:\/\/doi.org\/10.1145\/3335772.3335936","DOI":"10.1145\/3335772.3335936"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Levendovszky, T., Prange, U., Ehrig, H.: Termination criteria for DPO transformations with injective matches. In: Rensink, A., Heckel, R., K\u00f6nig, B. (eds.) Proceedings of the Workshop on Graph Transformation for Concurrency and Verification, GT-VC@CONCUR 2006, Bonn, Germany, August 31, 2006. Electronic Notes in Theoretical Computer Science, vol.\u00a0175, pp. 87\u2013100. Elsevier (2006). https:\/\/doi.org\/10.1016\/J.ENTCS.2007.04.019","DOI":"10.1016\/J.ENTCS.2007.04.019"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"L\u00f6we, M.: Graph rewriting in span-categories. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) Graph Transformations - 5th International Conference, ICGT 2010, Enschede, The Netherlands, September 27 \u2013 October 2, 2010. Proceedings. Lecture Notes in Computer Science, vol.\u00a06372, pp. 218\u2013233. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-15928-2_15","DOI":"10.1007\/978-3-642-15928-2_15"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Overbeek, R., Endrullis, J.: A PBPO+ graph rewriting tutorial. In: Grabmayer, C. (ed.) Proceedings Twelfth International Workshop on Computing with Terms and Graphs, TERMGRAPH@FSCD 2022, Technion, Haifa, Israel, 1st August 2022. EPTCS, vol.\u00a0377, pp. 45\u201363 (2022). https:\/\/doi.org\/10.4204\/EPTCS.377.3","DOI":"10.4204\/EPTCS.377.3"},{"key":"1_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/J.JLAMP.2023.100873","volume":"133","author":"R Overbeek","year":"2023","unstructured":"Overbeek, R., Endrullis, J., Rosset, A.: Graph rewriting and relabeling with $${\\text{ PBPO }}^{\\text{+ }}$$: A unifying theory for quasitoposes. J. Log. Algebraic Methods Program. 133, 100873 (2023). https:\/\/doi.org\/10.1016\/J.JLAMP.2023.100873","journal-title":"J. Log. Algebraic Methods Program."},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Overbeek, R., Endrullis, J.: Termination of graph transformation systems using weighted subgraph counting. Logical Methods in Computer Science Volume 20, Issue 4, 12 (Nov 2024). https:\/\/doi.org\/10.46298\/lmcs-20(4:12)2024","DOI":"10.46298\/lmcs-20(4:12)2024"},{"key":"1_CR24","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1524.001.0001","volume-title":"Basic Category Theory for Computer Scientists","author":"BC Pierce","year":"1991","unstructured":"Pierce, B.C.: Basic Category Theory for Computer Scientists. MIT Press, Foundations of computing (1991)"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Plump, D.: On termination of graph rewriting. In: Nagl, M. (ed.) Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG \u201995, Aachen, Germany, June 20-22, 1995, Proceedings. Lecture Notes in Computer Science, vol.\u00a01017, pp. 88\u2013100. Springer (1995). https:\/\/doi.org\/10.1007\/3-540-60618-1_68","DOI":"10.1007\/3-540-60618-1_68"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Plump, D.: Modular termination of graph transformation. In: Heckel, R., Taentzer, G. (eds.) Graph Transformation, Specifications, and Nets - In Memory of Hartmut Ehrig. Lecture Notes in Computer Science, vol. 10800, pp. 231\u2013244. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-75396-6_13","DOI":"10.1007\/978-3-319-75396-6_13"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Potop-Butucaru, M., Sznajder, N., Tixeuil, S., Urbain, X.: Formal methods for mobile robots. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Lecture Notes in Computer Science, vol. 11340, pp. 278\u2013313. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_12","DOI":"10.1007\/978-3-030-11072-7_12"},{"key":"1_CR28","unstructured":"Qiu, Q.: Termination of Injective DPO Graph Rewriting Systems using Subgraph Counting. Tech. rep., Universite Claude Bernard Lyon 1 (Mar 2025). https:\/\/hal.science\/hal-04955684"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"S\u00f6ldner, R., Plump, D.: Formalising the double-pushout approach to graph transformation. Log. Methods Comput. Sci. 20(4) (2024). https:\/\/doi.org\/10.46298\/LMCS-20(4:3)2024","DOI":"10.46298\/LMCS-20(4:3)2024"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Zantema, H., K\u00f6nig, B., Bruggink, H.J.S.: Termination of cycle rewriting. In: Dowek, G. (ed.) Rewriting and Typed Lambda Calculi - Joint International Conference, RTA-TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings. Lecture Notes in Computer Science, vol.\u00a08560, pp. 476\u2013490. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-08918-8_33","DOI":"10.1007\/978-3-319-08918-8_33"}],"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-031-94706-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:22:42Z","timestamp":1749727362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-94706-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031947056","9783031947063"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-94706-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"13 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Koblenz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/icgt-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}