{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T02:04:59Z","timestamp":1794535499605,"version":"4.9.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319502298","type":"print"},{"value":"9783319502304","type":"electronic"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50230-4_11","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T08:31:26Z","timestamp":1480494686000},"page":"145-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Attributed Graph Transformation via Rule Schemata: Church-Rosser Theorem"],"prefix":"10.1007","author":[{"given":"Ivaylo","family":"Hristakiev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"key":"11_CR1","unstructured":"Bak, C.: GP 2: efficient implementation of a graph programming language. Ph.D. thesis, Department of Computer Science, University of York (2015). \n                      http:\/\/etheses.whiterose.ac.uk\/12586\/"},{"key":"11_CR2","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 1978. LNCS, vol. 73, pp. 1\u201369. Springer, Heidelberg (1979). doi:\n                      10.1007\/BFb0025714"},{"key":"11_CR3","series-title":"Monographs in Theoretical Computer Science","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. Springer, Heidelberg (2006)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Golas, U., Habel, A., Lambers, L., Orejas, F.: \n                      \n                        \n                      \n                      $$\\cal{M}$$\n                    -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation. Math. Struct. Comput. Sci. 24(4) (2014)","DOI":"10.1017\/S0960129512000357"},{"key":"11_CR5","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). doi:\n                      10.1007\/3-540-07854-1_188"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-30203-2_13","volume-title":"Graph Transformations","author":"H Ehrig","year":"2004","unstructured":"Ehrig, H., Prange, U., Taentzer, G.: Fundamental theory for typed attributed graph transformation. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 161\u2013177. Springer, Heidelberg (2004). doi:\n                      10.1007\/978-3-540-30203-2_13"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45832-8_12","volume-title":"Graph Transformation","author":"A Habel","year":"2002","unstructured":"Habel, A., Plump, D.: Relabelling in graph transformation. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 135\u2013147. Springer, Heidelberg (2002). doi:\n                      10.1007\/3-540-45832-8_12"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-33654-6_15","volume-title":"Graph Transformations","author":"A Habel","year":"2012","unstructured":"Habel, A., Plump, D.: \n                      \n                        \n                      \n                      $$\\cal{M}$$\n                    , \n                      \n                        \n                      \n                      $$\\cal{N}$$\n                    -adhesive transformation systems. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 218\u2013233. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-33654-6_15"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45832-8_14","volume-title":"Graph Transformation","author":"R Heckel","year":"2002","unstructured":"Heckel, R., K\u00fcster, J.M., Taentzer, G.: Confluence of typed attributed graph transformation systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 161\u2013176. Springer, Heidelberg (2002). doi:\n                      10.1007\/3-540-45832-8_14"},{"key":"11_CR10","unstructured":"Hristakiev, I., Plump, D.: Attributed graph transformation via rule schemata: Church-Rosser theorem (long version) (2016). \n                      http:\/\/www.cs.york.ac.uk\/plasma\/publications\/pdf\/HristakievPlump.16.Full.pdf"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kulcs\u00e1r, G., Deckwerth, F., Lochau, M., Varr\u00f3, G., Sch\u00fcrr, A.: Improved conflict detection for graph transformation with attributes. In: Proceedings of Graphs as Models (GaM 2015). Electronic Proceedings in Theoretical Computer Science, vol. 181, pp. 97\u2013112 (2015)","DOI":"10.4204\/EPTCS.181.7"},{"key":"11_CR12","first-page":"185","volume-title":"Term Graph Rewriting: Theory and Practice","author":"M L\u00f6we","year":"1993","unstructured":"L\u00f6we, M., Korff, M., Wagner, A.: An algebraic framework for the transformation of attributed graphs. In: Sleep, R., Plasmeijer, M., van Eekelen, M. (eds.) Term Graph Rewriting: Theory and Practice, pp. 185\u2013199. Wiley, New York (1993)"},{"key":"11_CR13","unstructured":"Orejas, F., Lambers, L.: Symbolic attributed graphs for attributed graph transformation. In: Graph and Model Transformation. Electronic Communications of the EASST, vol. 30 (2010)"},{"key":"11_CR14","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: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday","author":"D Plump","year":"2005","unstructured":"Plump, D.: Confluence of graph transformation revisited. In: Middeldorp, A., Oostrom, V., Raamsdonk, F., Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday. LNCS, vol. 3838, pp. 280\u2013308. Springer, Heidelberg (2005). doi:\n                      10.1007\/11601548_16"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Plump, D.: The design of GP 2. In: Proceedings of the Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011). Electronic Proceedings in Theoretical Computer Science, vol. 82, pp. 1\u201316 (2012)","DOI":"10.4204\/EPTCS.82.1"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-30203-2_11","volume-title":"Graph Transformations","author":"D Plump","year":"2004","unstructured":"Plump, D., Steinert, S.: Towards graph programs for graph algorithms. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 128\u2013143. Springer, Heidelberg (2004). doi:\n                      10.1007\/978-3-540-30203-2_11"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-642-17322-6_2","volume-title":"Graph Transformations and Model-Driven Engineering: Essays Dedicated to Manfred Nagl on the Occasion of His 65th Birthday","author":"A Rensink","year":"2010","unstructured":"Rensink, A.: The edge of graph transformation \u2014 graphs for behavioural specification. In: Engels, G., Lewerentz, C., Sch\u00e4fer, W., Sch\u00fcrr, A., Westfechtel, B. (eds.) Graph Transformations and Model-Driven Engineering: Essays Dedicated to Manfred Nagl on the Occasion of His 65th Birthday. LNCS, vol. 5765, pp. 6\u201332. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-17322-6_2"}],"container-title":["Lecture Notes in Computer Science","Software Technologies: Applications and Foundations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50230-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:38:50Z","timestamp":1558316330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50230-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319502298","9783319502304"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50230-4_11","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-50230-4","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"STAF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Federation of International Conferences on Software Technologies: Applications and Foundations","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"staf2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}