{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:41Z","timestamp":1759639001009,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"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_2","type":"book-chapter","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:15:38Z","timestamp":1593044138000},"page":"20-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Confluence up to Garbage"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6767-2747","authenticated-orcid":false,"given":"Graham","family":"Campbell","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1148-822X","authenticated-orcid":false,"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,23]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","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":"2_CR2","unstructured":"Bak, C.: GP 2: efficient implementation of a graph programming language. Ph.D. thesis, Department of Computer Science, University of York, UK (2015). https:\/\/etheses.whiterose.ac.uk\/12586\/"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-25959-6_3","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"A Bakewell","year":"2004","unstructured":"Bakewell, A., Plump, D., Runciman, C.: Specifying pointer structures by graph reduction. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 30\u201344. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25959-6_3"},{"key":"2_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Vieweg+Teubner, Stuttgart (1979). https:\/\/doi.org\/10.1007\/978-3-663-09367-1"},{"key":"2_CR5","unstructured":"Campbell, G.: Efficient graph rewriting. BSc thesis, Department of Computer Science, University of York, UK (2019). https:\/\/arxiv.org\/abs\/1906.05170"},{"key":"2_CR6","unstructured":"Campbell, G., Plump, D.: Efficient recognition of graph languages. Technical report, Department of Computer Science, University of York, UK (2019). https:\/\/arxiv.org\/abs\/1911.12884"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-53982-4_5","volume-title":"Colloquium on Trees in Algebra and Programming","author":"A-C Caron","year":"1991","unstructured":"Caron, A.-C.: Linear bounded automata and rewrite systems: influence of initial configurations on decision properties. In: Abramsky, S., Maibaum, T.S.E. (eds.) CAAP 1991. LNCS, vol. 493, pp. 74\u201389. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-53982-4_5"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-50728-0_34","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B Courcelle","year":"1989","unstructured":"Courcelle, B.: The monadic second-order logic of graphs: definable sets of finite graphs. In: van Leeuwen, J. (ed.) WG 1988. LNCS, vol. 344, pp. 30\u201353. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-50728-0_34"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10(2), 303\u2013318 (1965). https:\/\/doi.org\/10.1016\/0022-247X(65)90125-3","journal-title":"J. Math. Anal. Appl."},{"key":"2_CR10","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"key":"2_CR11","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":"2_CR12","doi-asserted-by":"publisher","unstructured":"Ehrig, H., Pfender, M., Schneider, H.: Graph-grammars: an algebraic approach. In: Proceedings 14th Annual Symposium on Switching and Automata Theory, SWAT 1973, pp. 167\u2013180. IEEE (1973). https:\/\/doi.org\/10.1109\/SWAT.1973.11","DOI":"10.1109\/SWAT.1973.11"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Farrow, R., Kennedy, K., Zucconi, L.: Graph grammars and global program data flow analysis. In: Proceedings 17th Annual Symposium on Foundations of Computer Science, SFCS 1976, pp. 42\u201356. IEEE (1976). https:\/\/doi.org\/10.1109\/SFCS.1976.17","DOI":"10.1109\/SFCS.1976.17"},{"issue":"2\u20133","key":"2_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0167-6423(97)00023-3","volume":"31","author":"P Fradet","year":"1998","unstructured":"Fradet, P., M\u00e9tayer, D.L.: Structured gamma. Sci. Comput. Program 31(2\u20133), 263\u2013289 (1998). https:\/\/doi.org\/10.1016\/S0167-6423(97)00023-3","journal-title":"Sci. Comput. Program"},{"issue":"5","key":"2_CR15","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":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-74730-9_8","volume-title":"Software Technologies: Applications and Foundations","author":"I Hristakiev","year":"2018","unstructured":"Hristakiev, I., Plump, D.: Checking graph programs for confluence. In: Seidl, M., Zschaler, S. (eds.) STAF 2017. LNCS, vol. 10748, pp. 92\u2013108. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74730-9_8"},{"issue":"4","key":"2_CR17","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM 27(4), 797\u2013821 (1980). https:\/\/doi.org\/10.1145\/322217.322230","journal-title":"J. ACM"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/B978-0-08-012975-4.50028-X","volume-title":"Computational Problems in Abstract Algebra","author":"D Knuth","year":"1970","unstructured":"Knuth, D., Bendix, P.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon Press, Oxford (1970). https:\/\/doi.org\/10.1016\/B978-0-08-012975-4.50028-X"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Lambers, L.: Certifying rule-based models using graph transformation. Ph.D. thesis, Technical University of Berlin, Elektrotechnik und Informatik (2009). https:\/\/doi.org\/10.14279\/depositonce-2348","DOI":"10.14279\/depositonce-2348"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-75396-6_6","volume-title":"Graph Transformation, Specifications, and Nets","author":"L Lambers","year":"2018","unstructured":"Lambers, L., Born, K., Orejas, F., Str\u00fcber, D., Taentzer, G.: Initial conflicts and dependencies: critical pairs revisited. In: Heckel, R., Taentzer, G. (eds.) Graph Transformation, Specifications, and Nets. LNCS, vol. 10800, pp. 105\u2013123. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75396-6_6"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Lambers, L., Ehrig, H., Orejas, F.: Efficient conflict detection in graph transformation systems by essential critical pairs. In: Proceedings Fifth International Workshop on Graph Transformation and Visual Modeling Techniques, GT-VMT 2006, Electronic Notes in Theoretical Computer Science, vol. 211, pp. 17\u201326. Elsevier (2008). https:\/\/doi.org\/10.1016\/j.entcs.2008.04.026","DOI":"10.1016\/j.entcs.2008.04.026"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-030-23611-3_5","volume-title":"Graph Transformation","author":"L Lambers","year":"2019","unstructured":"Lambers, L., Kosiol, J., Str\u00fcber, D., Taentzer, G.: Exploring conflict reasons for graph transformation systems. In: Guerra, E., Orejas, F. (eds.) ICGT 2019. LNCS, vol. 11629, pp. 75\u201392. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23611-3_5"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","volume":"2","author":"E Lawler","year":"1978","unstructured":"Lawler, E.: Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math. 2, 75\u201390 (1978). https:\/\/doi.org\/10.1016\/S0167-5060(08)70323-6","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"2_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1287\/moor.4.3.215","volume":"4","author":"C Monma","year":"1979","unstructured":"Monma, C., Sidney, J.: Sequencing with series-parallel precedence constraints. Math. Oper. Res. 4(3), 215\u2013224 (1979). https:\/\/doi.org\/10.1287\/moor.4.3.215","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2_CR25","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M Newman","year":"1942","unstructured":"Newman, M.: On theories with a combinatorial definition of \u201cequivalence\u201d. Ann. Math. 43(2), 223\u2013243 (1942). https:\/\/doi.org\/10.2307\/1968867","journal-title":"Ann. Math."},{"key":"2_CR26","first-page":"201","volume-title":"Term Graph Rewriting","author":"D Plump","year":"1993","unstructured":"Plump, D.: Hypergraph rewriting: critical pairs and undecidability of confluence. In: Sleep, M.R., Plasmeijer, M.J., van Eekelen, M.C. (eds.) Term Graph Rewriting, pp. 201\u2013213. Wiley, Chichester (1993)"},{"key":"2_CR27","unstructured":"Plump, D.: Computing by graph rewriting. Habilitation thesis, Universit\u00e4t Bremen, Fachbereich Mathematik und Informatik (1999)"},{"key":"2_CR28","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":"2_CR29","doi-asserted-by":"publisher","unstructured":"Plump, D.: Reasoning about graph programs. In: Proceedings 9th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2016, Electronic Proceedings in Theoretical Computer Science, vol. 225, pp. 35\u201344. Open Publishing Association (2016). https:\/\/doi.org\/10.4204\/EPTCS.225.6","DOI":"10.4204\/EPTCS.225.6"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:53:55Z","timestamp":1710233635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51372-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030513719","9783030513726"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51372-6_2","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"}]}}