{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:06:16Z","timestamp":1762459576721,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319753959"},{"type":"electronic","value":"9783319753966"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75396-6_1","type":"book-chapter","created":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T21:33:53Z","timestamp":1517866433000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On the Essence of Parallel Independence for the Double-Pushout and Sesqui-Pushout Approaches"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6123-4175","authenticated-orcid":false,"given":"Andrea","family":"Corradini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Duval","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"L\u00f6we","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leila","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo","family":"Machado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Costa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3740-7002","authenticated-orcid":false,"given":"Guilherme Grochau","family":"Azzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8089-3691","authenticated-orcid":false,"given":"Jonas Santos","family":"Bezerra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5894-9070","authenticated-orcid":false,"given":"Leonardo Marques","family":"Rodrigues","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,7]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Bezerra, J.S., Costa, A., Azzi, G., Rodrigues, L.M., Machado, R., Ribeiro, L.: Verites\/verigraph: parallel independence benchmarks, June 2017. \nhttps:\/\/doi.org\/10.5281\/zenodo.814246","DOI":"10.5281\/zenodo.814246"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.entcs.2016.09.005","volume":"324","author":"JS Bezerra","year":"2016","unstructured":"Bezerra, J.S., Costa, A., Ribeiro, L., Cota, \u00c9.F.: Formal verification of health assessment tools: a case study. Electr. Notes Theor. Comput. Sci. 324, 31\u201350 (2016). \nhttps:\/\/doi.org\/10.1016\/j.entcs.2016.09.005","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-61470-0_8","volume-title":"Graph Transformation","author":"K Born","year":"2017","unstructured":"Born, K., Lambers, L., Str\u00fcber, D., Taentzer, G.: Granularity of conflicts and dependencies in graph transformation systems. In: de Lara, J., Plump, D. (eds.) ICGT 2017. LNCS, vol. 10373, pp. 125\u2013141. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-61470-0_8"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-50230-4_8","volume-title":"Software Technologies: Applications and Foundations","author":"A Corradini","year":"2016","unstructured":"Corradini, A.: On the definition of parallel independence in the algebraic approaches to graph transformation. In: Milazzo, P., Varr\u00f3, D., Wimmer, M. (eds.) STAF 2016. LNCS, vol. 9946, pp. 101\u2013111. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-50230-4_8"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-40530-8_3","volume-title":"Graph Transformation","author":"A Corradini","year":"2016","unstructured":"Corradini, A., Duval, D., Prost, F., Ribeiro, L.: Parallelism in AGREE transformations. In: Echahed, R., Minas, M. (eds.) ICGT 2016. LNCS, vol. 9761, pp. 37\u201353. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40530-8_3"},{"issue":"5","key":"1_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.entcs.2005.02.014","volume":"127","author":"A Corradini","year":"2005","unstructured":"Corradini, A., Gadducci, F.: On term graphs as an adhesive category. Electr. Notes Theor. Comput. Sci. 127(5), 43\u201356 (2005). \nhttps:\/\/doi.org\/10.1016\/j.entcs.2005.02.014","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"1_CR7","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). \nhttps:\/\/doi.org\/10.1007\/11841883_4"},{"key":"1_CR8","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: Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol. 1, pp. 163\u2013246. World Scientific Publishing Co., Inc (1997). \nhttp:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/9789812384720_0003"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-319-49815-7_5","volume-title":"Formal Methods: Foundations and Applications","author":"A Costa","year":"2016","unstructured":"Costa, A., Bezerra, J., Azzi, G., Rodrigues, L., Becker, T.R., Herdt, R.G., Machado, R.: Verigraph: a system for specification and analysis of graph grammars. In: Ribeiro, L., Lecomte, T. (eds.) SBMF 2016. LNCS, vol. 10090, pp. 78\u201394. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-49815-7_5"},{"key":"1_CR10","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09108-2_11"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0025714","volume-title":"Graph-Grammars and Their Application to Computer Science and Biology","author":"H Ehrig","year":"1979","unstructured":"Ehrig, H.: Introduction to the algebraic theory of graph grammars (a survey). In: Claus, V., Ehrig, H., Rozenberg, G. (eds.) Graph-Grammars and Their Application to Computer Science and Biology. LNCS, vol. 73, pp. 1\u201369. Springer, Heidelberg (1979). \nhttps:\/\/doi.org\/10.1007\/BFb0025714"},{"key":"1_CR12","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). \nhttps:\/\/doi.org\/10.1007\/3-540-07854-1_188"},{"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). \nhttps:\/\/doi.org\/10.1017\/S0960129501003425","journal-title":"Math. Struct. Comput. Sci."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/11691617_19","volume-title":"Model Checking Software","author":"H Kastenberg","year":"2006","unstructured":"Kastenberg, H., Rensink, A.: Model checking dynamic states in GROOVE. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol. 3925, pp. 299\u2013305. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11691617_19"},{"key":"1_CR15","unstructured":"Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon (1970). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/B978008012975450028X"},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1051\/ita:2005028","volume":"39","author":"S Lack","year":"2005","unstructured":"Lack, S., Sobocinski, P.: Adhesive and quasiadhesive categories. Theor. Inform. Appl. 39(3), 511\u2013545 (2005). \nhttps:\/\/doi.org\/10.1051\/ita:2005028","journal-title":"Theor. Inform. Appl."},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Lambers, L.: Certifying rule-based models using graph transformation. Ph.D. thesis, Technische Universit\u00e4t Berlin (2010). \nhttps:\/\/doi.org\/10.14279\/depositonce-2348","DOI":"10.14279\/depositonce-2348"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.entcs.2008.04.026","volume":"211","author":"L Lambers","year":"2008","unstructured":"Lambers, L., Ehrig, H., Orejas, F.: Efficient conflict detection in graph transformation systems by essential critical pairs. ENTCS 211, 17\u201326 (2008). \nhttps:\/\/doi.org\/10.1016\/j.entcs.2008.04.026","journal-title":"ENTCS"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-15928-2_15","volume-title":"Graph Transformations","author":"M L\u00f6we","year":"2010","unstructured":"L\u00f6we, M.: Graph rewriting in span-categories. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 218\u2013233. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15928-2_15"},{"key":"1_CR20","unstructured":"Plump, D.: Evaluation of functional expressions by hypergraph rewriting. Ph.D. thesis, University of Bremen, Germany (1993). \nhttp:\/\/d-nb.info\/940423774"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/1008343.1008344","volume":"7","author":"BK Rosen","year":"1975","unstructured":"Rosen, B.K.: A Church-Rosser theorem for graph grammars. ACM SIGACT News 7(3), 26\u201331 (1975). \nhttps:\/\/doi.org\/10.1145\/1008343.1008344","journal-title":"ACM SIGACT News"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-25959-6_35","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"G Taentzer","year":"2004","unstructured":"Taentzer, G.: AGG: a\u00a0graph transformation environment for modeling and validation of software. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 446\u2013453. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-25959-6_35"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation, Specifications, and Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75396-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T21:33:55Z","timestamp":1517866435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-75396-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319753959","9783319753966"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75396-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}