{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:59:41Z","timestamp":1771264781859,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030789459","type":"print"},{"value":"9783030789466","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78946-6_1","type":"book-chapter","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T06:02:53Z","timestamp":1623909773000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Concurrency Theorems for Non-linear Rewriting Theories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8738-5040","authenticated-orcid":false,"given":"Nicolas","family":"Behr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0817-1029","authenticated-orcid":false,"given":"Russ","family":"Harmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7261-7462","authenticated-orcid":false,"given":"Jean","family":"Krivine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"1_CR1","unstructured":"Adamek, J., Herrlich, H., Strecker, G.: Abstract and concrete categories: the joy of cats. Reprints Theory Appl. Categ. (17), 1\u2013507 (2006). http:\/\/www.tac.mta.ca\/tac\/reprints\/articles\/17\/tr17.pdf"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Behr, N.: Sesqui-pushout rewriting: concurrency, associativity and rule algebra framework. In: Proceedings of GCM 2019. EPTCS, vol. 309, pp. 23\u201352 (2019). https:\/\/doi.org\/10.4204\/eptcs.309.2","DOI":"10.4204\/eptcs.309.2"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Behr, N.: Tracelets and tracelet analysis of compositional rewriting systems. In: Proceedings of ACT 2019. EPTCS, vol. 323, pp. 44\u201371 (2020). https:\/\/doi.org\/10.4204\/EPTCS.323.4","DOI":"10.4204\/EPTCS.323.4"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Behr, N.: On stochastic rewriting and combinatorics via rule-algebraic methods. In: Proceedings of TERMGRAPH 2020, vol. 334, pp. 11\u201328 (2021). https:\/\/doi.org\/10.4204\/eptcs.334.2","DOI":"10.4204\/eptcs.334.2"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Behr, N., Danos, V., Garnier, I.: Stochastic mechanics of graph rewriting. In: Proceedings of LiCS 2016. ACM Press (2016). https:\/\/doi.org\/10.1145\/2933575.2934537","DOI":"10.1145\/2933575.2934537"},{"key":"1_CR6","unstructured":"Behr, N., Danos, V., Garnier, I.: Combinatorial conversion and moment bisimulation for stochastic rewriting systems. LMCS 16(3), 3:1\u20133:45 (2020). https:\/\/lmcs.episciences.org\/6628"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Behr, N., Harmer, R., Krivine, J.: Concurrency theorems for non-linear rewriting theories (long version). CoRR (2021). https:\/\/arxiv.org\/abs\/2105.02842","DOI":"10.1007\/978-3-030-78946-6_1"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-030-51372-6_11","volume-title":"Graph Transformation","author":"N Behr","year":"2020","unstructured":"Behr, N., Krivine, J.: Rewriting theory for the life sciences: a unifying theory of CTMC semantics. In: Gadducci, F., Kehrer, T. (eds.) ICGT 2020. LNCS, vol. 12150, pp. 185\u2013202. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51372-6_11"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.32408\/compositionality-3-2","volume":"3","author":"N Behr","year":"2021","unstructured":"Behr, N., Krivine, J.: Compositionality of rewriting rules with conditions. Compositionality 3, 2 (2021). https:\/\/doi.org\/10.32408\/compositionality-3-2","journal-title":"Compositionality"},{"key":"1_CR10","unstructured":"Behr, N., Sobocinski, P.: Rule algebras for adhesive categories (extended journal version). LMCS 16(3), 2:1\u20132:38 (2020). https:\/\/lmcs.episciences.org\/6615"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-030-33223-5_37","volume-title":"Conceptual Modeling","author":"A Bonifati","year":"2019","unstructured":"Bonifati, A., Furniss, P., Green, A., Harmer, R., Oshurko, E., Voigt, H.: Schema validation and evolution for graph databases. In: Laender, A.H.F., Pernici, B., Lim, E.-P., de Oliveira, J.P.M. (eds.) ER 2019. LNCS, vol. 11788, pp. 448\u2013456. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-33223-5_37"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Bousquet-M\u00e9lou, M.: Counting planar maps, coloured or uncoloured. London Mathematical Society Lecture Note Series. Cambridge University Press, pp. 1\u201350 (2011). https:\/\/doi.org\/10.1017\/CBO9781139004114.002","DOI":"10.1017\/CBO9781139004114.002"},{"issue":"13","key":"1_CR13","doi-asserted-by":"publisher","first-page":"i583","DOI":"10.1093\/bioinformatics\/bty272","volume":"34","author":"P Boutillier","year":"2018","unstructured":"Boutillier, P., et al.: The Kappa platform for rule-based modeling. Bioinformatics 34(13), i583\u2013i592 (2018). https:\/\/doi.org\/10.1093\/bioinformatics\/bty272","journal-title":"Bioinformatics"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.jsc.2010.09.007","volume":"46","author":"B Braatz","year":"2011","unstructured":"Braatz, B., Golas, U., Soboll, T.: How to delete categorically\u2014two pushout complement constructions. J. Symb. Comput. 46(3), 246\u2013271 (2011). https:\/\/doi.org\/10.1016\/j.jsc.2010.09.007","journal-title":"J. Symb. Comput."},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(00)00382-0","volume":"270","author":"J Cockett","year":"2002","unstructured":"Cockett, J., Lack, S.: Restriction categories I: categories of partial maps. Theor. Comput. Sci. 270(1), 223\u2013259 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(00)00382-0","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0304-3975(01)00245-6","volume":"294","author":"J Cockett","year":"2003","unstructured":"Cockett, J., Lack, S.: Restriction categories II: partial map classification. Theor. Comput. Sci. 294(1), 61\u2013102 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(01)00245-6","journal-title":"Theor. Comput. Sci."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11841883_4","volume-title":"Graph Transformations","author":"A Corradini","year":"2006","unstructured":"Corradini, A., Heindel, T., Hermann, F., K\u00f6nig, B.: Sesqui-pushout rewriting. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 30\u201345. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841883_4"},{"key":"1_CR18","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":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-09108-2_11","volume-title":"Graph Transformation","author":"V Danos","year":"2014","unstructured":"Danos, V., Heindel, T., Honorato-Zimmer, R., Stucki, S.: Reversible Sesqui-pushout rewriting. In: Giese, H., K\u00f6nig, B. (eds.) ICGT 2014. LNCS, vol. 8571, pp. 161\u2013176. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09108-2_11"},{"key":"1_CR20","unstructured":"Diers, Y.: Familles universelles de morphismes, Publications de l\u2019U.E.R. math\u00e9matiques pures et appliqu\u00e9es, vol. 145. Universit\u00e9 des sciences et techniques de Lille I (1978)"},{"issue":"1\u20132","key":"1_CR21","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0022-4049(87)90124-1","volume":"49","author":"R Dyckhoff","year":"1987","unstructured":"Dyckhoff, R., Tholen, W.: Exponentiable morphisms, partial products and pullback complements. J. Pure Appl. Algebra 49(1\u20132), 103\u2013116 (1987)","journal-title":"J. Pure Appl. Algebra"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Ehrig, H., et al.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2","DOI":"10.1007\/3-540-31188-2"},{"key":"1_CR23","first-page":"111","volume":"102","author":"H Ehrig","year":"2010","unstructured":"Ehrig, H., Golas, U., Hermann, F.: Categorical frameworks for graph transformation and HLR systems based on the DPO approach. Bull. EATCS 102, 111\u2013121 (2010)","journal-title":"Bull. EATCS"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-30203-2_12","volume-title":"Graph Transformations","author":"H Ehrig","year":"2004","unstructured":"Ehrig, H., Habel, A., Padberg, J., Prange, U.: Adhesive high-level replacement categories and systems. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 144\u2013160. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30203-2_12"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Ehrig, H., et al.: $$\\cal{M}$$-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation. MSCS 24(04), 1\u201348 (2014). https:\/\/doi.org\/10.1017\/s0960129512000357","DOI":"10.1017\/s0960129512000357"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-15928-2_16","volume-title":"Graph Transformations","author":"B Braatz","year":"2010","unstructured":"Braatz, B., Ehrig, H., Gabriel, K., Golas, U.: Finitary $$\\cal{M}$$-adhesive categories. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 234\u2013249. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15928-2_16"},{"issue":"3","key":"1_CR27","first-page":"27","volume":"27","author":"R Garner","year":"2012","unstructured":"Garner, R., Lack, S.: On the axioms for adhesive and quasiadhesive categories. TAC 27(3), 27\u201346 (2012)","journal-title":"TAC"},{"issue":"5","key":"1_CR28","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1109\/TCBB.2019.2906164","volume":"16","author":"R Harmer","year":"2019","unstructured":"Harmer, R., Le Cornec, Y.S., L\u00e9gar\u00e9, S., Oshurko, E.: Bio-curation for cellular signalling: the kami project. IEEE\/ACM Trans. Comput. Biol. Bioinform. 16(5), 1562\u20131573 (2019). https:\/\/doi.org\/10.1109\/TCBB.2019.2906164","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"1_CR29","first-page":"100559","volume":"114","author":"R Harmer","year":"2020","unstructured":"Harmer, R., Oshurko, E.: Knowledge representation and update in hierarchies of graphs. JLAMP 114, 100559 (2020)","journal-title":"JLAMP"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"145","DOI":"10.4204\/eptcs.330.9","volume":"330","author":"R Harmer","year":"2020","unstructured":"Harmer, R., Oshurko, E.: Reversibility and composition of rewriting in hierarchies. EPTCS 330, 145\u2013162 (2020). https:\/\/doi.org\/10.4204\/eptcs.330.9","journal-title":"EPTCS"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-15928-2_17","volume-title":"Graph Transformations","author":"T Heindel","year":"2010","unstructured":"Heindel, T.: Hereditary pushouts reconsidered. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 250\u2013265. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15928-2_17"},{"key":"1_CR32","volume-title":"Sketches of an Elephant - A Topos Theory Compendium","author":"PT Johnstone","year":"2002","unstructured":"Johnstone, P.T.: Sketches of an Elephant - A Topos Theory Compendium, vol. 1. Oxford University Press, Oxford (2002)"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-73859-6_21","volume-title":"Algebra and Coalgebra in Computer Science","author":"PT Johnstone","year":"2007","unstructured":"Johnstone, P.T., Lack, S., Soboci\u0144ski, P.: Quasitoposes, quasiadhesive categories and artin glueing. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 312\u2013326. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73859-6_21"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-24727-2_20","volume-title":"Foundations of Software Science and Computation Structures","author":"S Lack","year":"2004","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FoSSaCS 2004. LNCS, vol. 2987, pp. 273\u2013288. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24727-2_20"},{"issue":"3","key":"1_CR35","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1051\/ita:2005028","volume":"39","author":"S Lack","year":"2005","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. RAIRO - Theor. Inform. Appl. 39(3), 511\u2013545 (2005). https:\/\/doi.org\/10.1051\/ita:2005028","journal-title":"RAIRO - Theor. Inform. Appl."},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-21145-9_1","volume-title":"Graph Transformation","author":"M L\u00f6we","year":"2015","unstructured":"L\u00f6we, M.: Polymorphic Sesqui-pushout graph rewriting. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 3\u201318. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21145-9_1"},{"issue":"2","key":"1_CR37","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0022-4049(86)90077-0","volume":"42","author":"G Monro","year":"1986","unstructured":"Monro, G.: Quasitopoi, logic and heyting-valued models. J. Pure Appl. Algebra 42(2), 141\u2013164 (1986). https:\/\/doi.org\/10.1016\/0022-4049(86)90077-0","journal-title":"J. Pure Appl. Algebra"}],"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-78946-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T23:31:27Z","timestamp":1624318287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78946-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030789459","9783030789466"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78946-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 June 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2021","order":10,"name":"conference_id","label":"Conference ID","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":"26","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":"14","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":"54% - 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":"3","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":"In addition, the proceedings contain 2 tool papers.","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)"}}]}}