{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:00:05Z","timestamp":1725858005310},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319405292"},{"type":"electronic","value":"9783319405308"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40530-8_3","type":"book-chapter","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T06:53:01Z","timestamp":1466664781000},"page":"37-53","source":"Crossref","is-referenced-by-count":3,"title":["Parallelism in AGREE Transformations"],"prefix":"10.1007","author":[{"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":"Frederic","family":"Prost","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leila","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,22]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-540-87405-8_16","volume-title":"Graph Transformations","author":"F Bonchi","year":"2008","unstructured":"Bonchi, F., Gadducci, F., Heindel, T.: Parallel and sequential independence for borrowed contexts. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 226\u2013241. Springer, Heidelberg (2008)"},{"issue":"1\u20132","key":"3_CR2","doi-asserted-by":"crossref","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\u20132), 61\u2013102 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Heidelberg (2015)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"3_CR5","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: Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol. 1, pp. 163\u2013246. World Scientific, Singapore (1997)","DOI":"10.1142\/9789812384720_0003"},{"key":"3_CR6","unstructured":"Danos, V., Feret, J., Fontana, W., Harmer, R., Hayman, J., Krivine, J., Thompson-Walsh, C.D., Winskel, G.: Graphs, rewriting and pathway reconstruction for rule-based models. In: FSTTCS 2012. LIPIcs, vol. 18, pp. 276\u2013288. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Heidelberg (2014)"},{"key":"3_CR8","series-title":"Concurrency, Parallelism and Distribution","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformations","year":"1999","unstructured":"Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformations. Concurrency, Parallelism and Distribution, vol. 3. World Scientific, Singapore (1999)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"3_CR10","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. Bulletin of the EATCS 102, 111\u2013121 (2010)","journal-title":"Bulletin of the EATCS"},{"key":"3_CR11","first-page":"1","volume":"26","author":"H Ehrig","year":"2010","unstructured":"Ehrig, H., Habel, A., Lambers, L.: Parallelism and concurrency theorems for rules with nested application conditions. Electronic Communications of the EASST 26, 1\u201323 (2010)","journal-title":"Electronic Communications of the EASST"},{"issue":"1&2","key":"3_CR12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(93)90066-3","volume":"109","author":"H Ehrig","year":"1993","unstructured":"Ehrig, H., L\u00f6we, M.: Parallel and distributed derivations in the single-pushout approach. Theor. Comput. Sci. 109(1&2), 123\u2013143 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"3_CR13","first-page":"1","volume":"24","author":"F Hermann","year":"2014","unstructured":"Hermann, F., Corradini, A., Ehrig, H.: Analysis of permutation equivalence M-adhesive transformation systems with negative application conditions. Math. Struct. Comput. Sci. 24(4), 1\u201347 (2014)","journal-title":"Math. Struct. Comput. Sci."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"1","key":"3_CR15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.entcs.2004.12.033","volume":"127","author":"F Rossell\u00f3","year":"2005","unstructured":"Rossell\u00f3, F., Valiente, G.: Chemical graphs, chemical reaction graphs, and chemical graph transformation. Electr. Notes Theor. Comput. Sci. 127(1), 157\u2013166 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/978-3-540-89020-1_35","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"G Taentzer","year":"2008","unstructured":"Taentzer, G., et al.: Generation of Sierpinski triangles: a case study for graph transformation tools. In: Sch\u00fcrr, A., Nagl, M., Z\u00fcndorf, A. (eds.) AGTIVE 2007. LNCS, vol. 5088, pp. 514\u2013539. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40530-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:54:12Z","timestamp":1498323252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40530-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405292","9783319405308"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40530-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}