{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:37:38Z","timestamp":1743140258668,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319929903"},{"type":"electronic","value":"9783319929910"}],"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-92991-0_9","type":"book-chapter","created":{"date-parts":[[2018,5,28]],"date-time":"2018-05-28T15:38:38Z","timestamp":1527521918000},"page":"134-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Equivalence and Independence in\u00a0Controlled Graph-Rewriting Processes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5387-8277","authenticated-orcid":false,"given":"G\u00e9za","family":"Kulcs\u00e1r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6123-4175","authenticated-orcid":false,"given":"Andrea","family":"Corradini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8404-753X","authenticated-orcid":false,"given":"Malte","family":"Lochau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2012.04.046","volume":"449","author":"P Baldan","year":"2012","unstructured":"Baldan, P., Bruni, A., Corradini, A., K\u00f6nig, B., Rodr\u00edguez, C., Schwoon, S.: Efficient unfolding of contextual Petri nets. Theor. Comput. Sci. 449, 2\u201322 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.04.046","journal-title":"Theor. Comput. Sci."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1142\/9789812814951_0003","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"PAOLO BALDAN","year":"1999","unstructured":"Baldan, P., Corradini, A., Montanari, U., Rossi, F., Ehrig, H., L\u00f6we, M.: Concurrent semantics of algebraic graph transformation. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 3, pp. 107\u2013187. World Scientific (1999). https:\/\/doi.org\/10.1142\/9789812814951_0003"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BFb0025718","volume-title":"Graph-Grammars and Their Application to Computer Science and Biology","author":"H Bunke","year":"1979","unstructured":"Bunke, H.: Programmed graph grammars. In: Claus, V., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol. 73, pp. 155\u2013166. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/BFb0025718"},{"issue":"3\/4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundam. Inform. 26(3\/4), 241\u2013265 (1996). https:\/\/doi.org\/10.3233\/FI-1996-263402","journal-title":"Fundam. Inform."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-75396-6_1","volume-title":"Graph Transformation, Specifications, and Nets","author":"A Corradini","year":"2018","unstructured":"Corradini, A., et al.: On the essence of parallel independence for the double-pushout and sesqui-pushout approaches. In: Heckel, R., Taentzer, G. (eds.) Graph Transformation, Specifications, and Nets. LNCS, vol. 10800, pp. 1\u201318. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75396-6_1"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-662-07675-0_3","volume-title":"Handbook of Formal Languages","author":"J Dassow","year":"1997","unstructured":"Dassow, J., P\u0103un, G., Salomaa, A.: Grammars with controlled derivations. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2, pp. 101\u2013154. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-662-07675-0_3"},{"key":"9_CR7","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. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-24727-2_12","volume-title":"Foundations of Software Science and Computation Structures","author":"H Ehrig","year":"2004","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting. In: Walukiewicz, I. (ed.) FoSSaCS 2004. LNCS, vol. 2987, pp. 151\u2013166. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24727-2_12"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-46464-8_21","volume-title":"Theory and Application of Graph Transformations","author":"T Fischer","year":"2000","unstructured":"Fischer, T., Niere, J., Torunski, L., Z\u00fcndorf, A.: Story diagrams: a new graph rewrite language based on the unified modeling language and Java. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 296\u2013309. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46464-8_21"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-45315-6_15","volume-title":"Foundations of Software Science and Computation Structures","author":"A Habel","year":"2001","unstructured":"Habel, A., Plump, D.: Computational completeness of programming languages based on graph transformation. In: Honsell, F., Miculan, M. (eds.) FoSSaCS 2001. LNCS, vol. 2030, pp. 230\u2013245. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45315-6_15"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jvlc.2016.10.003","volume":"38","author":"R Kluge","year":"2017","unstructured":"Kluge, R., Stein, M., Varr\u00f3, G., Sch\u00fcrr, A., Hollick, M., M\u00fchlh\u00e4user, M.: A systematic approach to constructing families of incremental topology control algorithms using graph transformation. Softw. Syst. Model. 38, 47\u201383 (2017). https:\/\/doi.org\/10.1016\/j.jvlc.2016.10.003","journal-title":"Softw. Syst. Model."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-319-08789-4_10","volume-title":"Theory and Practice of Model Transformations","author":"E Leblebici","year":"2014","unstructured":"Leblebici, E., Anjorin, A., Sch\u00fcrr, A.: Developing eMoflon with eMoflon. In: Di Ruscio, D., Varr\u00f3, D. (eds.) ICMT 2014. LNCS, vol. 8568, pp. 138\u2013145. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08789-4_10"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Plump, D., Steinert, S.: The semantics of graph programs. In: RULE. EPTCS, vol. 21 (2009). https:\/\/doi.org\/10.4204\/EPTCS.21.3","DOI":"10.4204\/EPTCS.21.3"},{"issue":"3, 4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.3233\/FI-1996-263407","volume":"26","author":"A Sch\u00fcrr","year":"1996","unstructured":"Sch\u00fcrr, A.: Logic-based programmed structure rewriting systems. Fundam. Inform. 26(3, 4), 363\u2013385 (1996). https:\/\/doi.org\/10.3233\/FI-1996-263407","journal-title":"Fundam. Inform."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1142\/9789812815149_0013","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. SCH\u00dcRR","year":"1999","unstructured":"Sch\u00fcrr, A., Winter, A.J., Z\u00fcndorf, A.: The PROGRES-approach: language and environment. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 2, pp. 487\u2013550. World Scientific (1999). https:\/\/doi.org\/10.1142\/9789812815149_0013"}],"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-319-92991-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:59:01Z","timestamp":1710341941000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-92991-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319929903","9783319929910"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92991-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 May 2018","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":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.hpi.uni-potsdam.de\/giese\/events\/icgt2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}