{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:11:35Z","timestamp":1762459895340,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030513719"},{"type":"electronic","value":"9783030513726"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-51372-6_8","type":"book-chapter","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:15:38Z","timestamp":1593044138000},"page":"128-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Patch Graph Rewriting"],"prefix":"10.1007","author":[{"given":"Roy","family":"Overbeek","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Endrullis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,23]]},"reference":[{"issue":"3,4","key":"8_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"ZM Ariola","year":"1996","unstructured":"Ariola, Z.M., Klop, J.W.: Equational term graph rewriting. Fundamenta Informaticae. 26(3,4), 207\u2013240 (1996). https:\/\/doi.org\/10.3233\/FI-1996-263401","journal-title":"Fundamenta Informaticae."},{"key":"8_CR2","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":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-21145-9_3","volume-title":"Graph Transformation","author":"A Corradini","year":"2015","unstructured":"Corradini, A., Duval, D., Echahed, R., Prost, F., Ribeiro, L.: AGREE \u2013 algebraic graph rewriting with controlled embedding. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 35\u201351. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21145-9_3"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.jlamp.2018.12.003","volume":"103","author":"A Corradini","year":"2019","unstructured":"Corradini, A., Duval, D., Echahed, R., Prost, F., Ribeiro, L.: The PBPO graph transformation approach. J. Log. Algebr. Meth. Program. 103, 213\u2013231 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2018.12.003","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Graph path orderings. In LPAR, volume 57 of EPiC Series in Computing, EasyChair, pp. 307\u2013325 (2018). https:\/\/doi.org\/10.29007\/6hkk","DOI":"10.29007\/6hkk"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.tcs.2019.01.029","volume":"777","author":"N Dershowitz","year":"2019","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Drags: a compositional algebraic framework for graph rewriting. Theor. Comput. Sci. 777, 204\u2013231 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.01.029","journal-title":"Theor. Comput. Sci."},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-18771-5_40","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"H Ehrig","year":"1987","unstructured":"Ehrig, H.: Tutorial introduction to the algebraic approach of graph grammars. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.) Graph Grammars 1986. LNCS, vol. 291, pp. 1\u201314. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-18771-5_40"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BFb0017375","volume-title":"Graph Grammars and Their Application to Computer Science","author":"H Ehrig","year":"1991","unstructured":"Ehrig, H., Korff, M., L\u00f6we, M.: Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 24\u201337. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0017375"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Ehrig, H., Pfender, M., Schneider, H.J.: Graph-grammars: an algebraic approach. In: Proceedings of the 14th Annual Symposium on Switching and Automata Theory, Swat 1973, pp. 167\u2013180. IEEE Computer Society (1973). https:\/\/doi.org\/10.1109\/SWAT.1973.11","DOI":"10.1109\/SWAT.1973.11"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(80)90016-X","volume":"11","author":"H Ehrig","year":"1980","unstructured":"Ehrig, H., Rosen, B.K.: Parallelism and concurrency of graph manipulations. Theoret. Comput. Sci. 11(3), 247\u2013275 (1980). https:\/\/doi.org\/10.1016\/0304-3975(80)90016-X","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Endrullis, J., de Vrijer, R.C., Waldmann, J.: Local termination theory and practice. Logical Methods Comput. Sci. 6(3) (2010)","DOI":"10.2168\/LMCS-6(3:20)2010"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Endrullis, J., Klop, J.W., Overbeek, R.: Decreasing diagrams for confluence and commutation. Logical Methods Comput. Sci. 16(1) (2020). https:\/\/doi.org\/10.23638\/LMCS-16(1:23)2020","DOI":"10.23638\/LMCS-16(1:23)2020"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Endrullis, J., Zantema, H.: Proving non-termination by finite automata. In: Proceedings Conference on Rewriting Techniques and Applications, RTA 2015, LIPIcs, vol. 36, pp. 160\u2013176. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2015.160","DOI":"10.4230\/LIPIcs.RTA.2015.160"},{"key":"8_CR14","volume-title":"Distributed Algorithms: An Intuitive Approach","author":"W Fokkink","year":"2014","unstructured":"Fokkink, W.: Distributed Algorithms: An Intuitive Approach. MIT Press, Cambridge (2014)"},{"issue":"3\/4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.3233\/FI-1996-263404","volume":"26","author":"A Habel","year":"1996","unstructured":"Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundam. Inform. 26(3\/4), 287\u2013313 (1996). https:\/\/doi.org\/10.3233\/FI-1996-263404","journal-title":"Fundam. Inform."},{"issue":"5","key":"8_CR16","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":"8_CR17","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. 2505, pp. 161\u2013176. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45832-8_14"},{"issue":"1&2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","volume":"109","author":"M L\u00f6we","year":"1993","unstructured":"L\u00f6we, M.: Algebraic approach to single-pushout graph transformation. Theor. Comput. Sci. 109(1&2), 181\u2013224 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90068-5","journal-title":"Theor. Comput. Sci."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-030-04771-9_32","volume-title":"Software Technologies: Applications and Foundations","author":"M L\u00f6we","year":"2018","unstructured":"L\u00f6we, M.: Double-pushout rewriting in context. In: Mazzara, M., Ober, I., Sala\u00fcn, G. (eds.) STAF 2018. LNCS, vol. 11176, pp. 447\u2013462. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04771-9_32"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-23611-3_2","volume-title":"Graph Transformation","author":"M L\u00f6we","year":"2019","unstructured":"L\u00f6we, M.: Double-pushout rewriting in context. In: Guerra, E., Orejas, F. (eds.) ICGT 2019. LNCS, vol. 11629, pp. 21\u201337. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23611-3_2"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-18771-5_43","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"M Nagl","year":"1987","unstructured":"Nagl, M.: Set theoretic approaches to graph grammars. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.) Graph Grammars 1986. LNCS, vol. 291, pp. 41\u201354. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-18771-5_43"},{"key":"8_CR22","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"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-24725-8_28","volume-title":"Programming Languages and Systems","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Canonical graph shapes. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 401\u2013415. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24725-8_28"}],"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-030-51372-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:55:45Z","timestamp":1710233745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51372-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030513719","9783030513726"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51372-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Bergen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/av5.ljnet.it\/icgt2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 tool presentations were also accepted and included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}