{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T05:11:43Z","timestamp":1790485903914,"version":"4.1.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319753959","type":"print"},{"value":"9783319753966","type":"electronic"}],"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_5","type":"book-chapter","created":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T02:33:53Z","timestamp":1517884433000},"page":"83-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["A Tutorial on Graph Transformation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4193-2889","authenticated-orcid":false,"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6170-6600","authenticated-orcid":false,"given":"Dennis","family":"Nolte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julia","family":"Padberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1714-6319","authenticated-orcid":false,"given":"Arend","family":"Rensink","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,2,7]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6423(98)00023-9","volume":"34","author":"M Andries","year":"1999","unstructured":"Andries, M., Engels, G., Habel, A., Hoffmann, B., Kreowski, H.-J., Kuske, S., Plump, D., Sch\u00fcrr, A., Taentzer, G.: Graph transformation for specification and programming. Sci. Comput. Program. 34(1), 1\u201354 (1999)","journal-title":"Sci. Comput. Program."},{"key":"5_CR2","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"issue":"5","key":"5_CR3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/359104.359108","volume":"22","author":"EJH Chang","year":"1979","unstructured":"Chang, E.J.H., Roberts, R.: An improved algorithm for decentralized extrema-finding in circular configurations of processes. Commun. ACM 22(5), 281\u2013283 (1979)","journal-title":"Commun. ACM"},{"key":"5_CR4","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation\u2013part I: basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific (1997). Chapter 3"},{"key":"5_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic, A Language-Theoretic Approach","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic, A Language-Theoretic Approach. Cambridge University Press, New York (2012)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Csert\u00e1n, G., Huszerl, G., Majzik, I., Pap, Z., Pataricza, A., Varr\u00f3, D.: VIATRA - visual automated transformations for formal verification and validation of UML models. In: 17th IEEE International Conference on Automated Software Engineering, pp. 267\u2013270. IEEE Computer Society (2002)","DOI":"10.1109\/ASE.2002.1115027"},{"key":"5_CR7","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: Proceedings of the FSTTCS 2012. LIPIcs, vol. 18. Schloss Dagstuhl - Leibniz Center for Informatics (2012)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45923-5_12","volume-title":"Fundamental Approaches to Software Engineering","author":"J Lara","year":"2002","unstructured":"Lara, J., Vangheluwe, H.: AToM3: a tool for multi-formalism and meta-modelling. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, pp. 174\u2013188. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45923-5_12"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (eds.) Formal Models and Semantics. Handbook of Theoretical Computer Science, vol. B, pp. 243\u2013320. Elsevier (1990). Chapter 6","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"5_CR10","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). https:\/\/doi.org\/10.1007\/BFb0025714"},{"key":"5_CR11","series-title":"Monographs in Theoretical Computer Science","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. Monographs in Theoretical Computer Science. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"key":"5_CR12","series-title":"Applications Languages and Tools","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","year":"1999","unstructured":"Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Applications Languages and Tools. World Scientific, Singapore (1999)"},{"key":"5_CR13","series-title":"Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47980-3","volume-title":"Graph and Model Transformation - General Framework and Applications","author":"H Ehrig","year":"2015","unstructured":"Ehrig, H., Ermel, C., Golas, U., Hermann, F.: Graph and Model Transformation - General Framework and Applications. Monographs in Theoretical Computer Science. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47980-3"},{"issue":"6","key":"5_CR14","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1017\/S096012950600569X","volume":"16","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Math. Struct. Comput. Sci. 16(6), 1133\u20131163 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"5_CR15","series-title":"Concurrency, Parallellism, and Distribution","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","year":"1999","unstructured":"Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Concurrency, Parallellism, and Distribution. World Scientific, Singapore (1999)"},{"key":"5_CR16","series-title":"Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69962-7","volume-title":"Fundamentals of Algebraic Specification 1, Equations and Initial Semantics","author":"H Ehrig","year":"1985","unstructured":"Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1, Equations and Initial Semantics. Monographs in Theoretical Computer Science. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-69962-7"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., Schneider, H.: Graph grammars: an algebraic approach. In: Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, pp. 167\u2013180 (1973)","DOI":"10.1109\/SWAT.1973.11"},{"key":"5_CR18","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). https:\/\/doi.org\/10.1007\/978-3-540-30203-2_13"},{"key":"5_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04293-9","volume-title":"Introduction to Process Algebra","author":"W Fokkink","year":"2000","unstructured":"Fokkink, W.: Introduction to Process Algebra. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-662-04293-9"},{"issue":"1","key":"5_CR20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10009-011-0186-x","volume":"14","author":"AH Ghamarian","year":"2012","unstructured":"Ghamarian, A.H., de Mol, M.J., Rensink, A., Zambon, E., Zimakova, M.V.: Modelling and analysis using groove. Int. J. Soft. Tools Technol. Transf. 14(1), 15\u201340 (2012)","journal-title":"Int. J. Soft. Tools Technol. Transf."},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-30982-3_5","volume-title":"Formal Methods for Model-Driven Engineering","author":"H Giese","year":"2012","unstructured":"Giese, H., Lambers, L., Becker, B., Hildebrandt, S., Neumann, S., Vogel, T., W\u00e4tzoldt, S.: Graph transformations for MDE, adaptation, and models at runtime. In: Bernardo, M., Cortellessa, V., Pierantonio, A. (eds.) SFM 2012. LNCS, vol. 7320, pp. 137\u2013191. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30982-3_5"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-31847-7_17","volume-title":"Formal Methods in Software and Systems Modeling","author":"A Habel","year":"2005","unstructured":"Habel, A., Pennemann, K.-H.: Nested constraints and application conditions for high-level structures. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 293\u2013308. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31847-7_17"},{"key":"5_CR23","unstructured":"Heckel, R.: Graph transformation in a nutshell. In: Bezivin, J., Heckel, R. (eds.) Language Engineering for Model-Driven Software Development, number 04101 in Dagstuhl Seminar Proceedings (2005)"},{"key":"5_CR24","unstructured":"H\u00f8gh Jensen, O., Milner, R.: Bigraphs and mobile processes (revised). Technical report UCAM-CL-TR-580, University of Cambridge (2004)"},{"key":"5_CR25","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1308\/147363505X39437","volume":"87","author":"B K\u00f6nig","year":"2005","unstructured":"K\u00f6nig, B., Kozioura, V.: Augur - a tool for the analysis of graph transformation systems. Bull. EATCS 87, 126\u2013137 (2005)","journal-title":"Bull. EATCS"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-87405-8_21","volume-title":"Graph Transformations","author":"B K\u00f6nig","year":"2008","unstructured":"K\u00f6nig, B., Kozioura, V.: Towards the verification of attributed graph transformation systems. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 305\u2013320. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87405-8_21"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-33461-3_9","volume-title":"Recent Advances in Formal Languages and Applications","author":"H-J Kreowski","year":"2006","unstructured":"Kreowski, H.-J., Klempien-Hinrichs, R., Kuske, S.: Some essentials of graph transformation. In: \u00c9sik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications, pp. 229\u2013254. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/978-3-540-33461-3_9"},{"issue":"3","key":"5_CR28","doi-asserted-by":"crossref","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. Inf. Appl. 39(3), 511\u2013545 (2005)","journal-title":"RAIRO - Theor. Inf. Appl."},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"JJ Leifer","year":"2000","unstructured":"Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243\u2013258. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44618-4_19"},{"key":"5_CR30","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","volume":"109","author":"M L\u00f6we","year":"1993","unstructured":"L\u00f6we, M.: Algebraic approach to single-pushout graph transformation. Theor. Comput. Sci. 109, 181\u2013224 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR31","volume-title":"Algebraische Graphersetzung: mathematische Modellierung und Konfluenz","author":"M L\u00f6we","year":"1993","unstructured":"L\u00f6we, M., M\u00fcller, J.: Algebraische Graphersetzung: mathematische Modellierung und Konfluenz. Forschungsbericht des Fachbereichs Informatik, TU Berlin, Berlin (1993)"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Nickel, U., Niere, J., Z\u00fcndorf, A.: The FUJABA environment. In: Ghezzi, C., Jazayeri, M., Wolf, A.L. (eds.) Proceedings of the 22nd International Conference on on Software Engineering, pp. 742\u2013745. ACM (2000)","DOI":"10.1145\/337180.337620"},{"issue":"3","key":"5_CR34","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.jsc.2010.09.009","volume":"46","author":"F Orejas","year":"2011","unstructured":"Orejas, F.: Symbolic graphs for attributed graph constraints. J. Symbolic Comput. 46(3), 294\u2013315 (2011)","journal-title":"J. Symbolic Comput."},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-3-319-75396-6_11","volume-title":"Ehrig Festschrift","author":"J Padberg","year":"2018","unstructured":"Padberg, J., Kahloul, L.: Overview of reconfigurable Petri nets. In: Heckel, R., Taentzer, G. (eds.) Ehrig Festschrift. LNCS, vol. 10800, pp. 201\u2013222. Springer, Cham (2018)"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Plump, D.: Computing by Graph Rewriting. Habilitation thesis, Universit\u00e4t Bremen (1999)","DOI":"10.1142\/9789812815149_0001"},{"key":"5_CR37","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). https:\/\/doi.org\/10.1007\/978-3-540-30203-2_11"},{"key":"5_CR38","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-69968-9"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-25959-6_40","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: The GROOVE simulator: a\u00a0tool for state space generation. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 479\u2013485. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25959-6_40"},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-30203-2_23","volume-title":"Graph Transformations","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319\u2013335. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30203-2_23"},{"key":"5_CR41","unstructured":"Rensink, A., Kuperus, J.-H.: Repotting the geraniums: on nested graph transformation rules. In: Boronat, A., Heckel, R. (eds.) Graph Transformation and Visual Modelling Techniques (GT-VMT). Electronic Communications of the EASST, vol. 18 (2009)"},{"key":"5_CR42","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations","year":"1997","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, Singapore (1997)"},{"key":"5_CR43","doi-asserted-by":"crossref","DOI":"10.1017\/9781316134924","volume-title":"The $$\\pi $$ \u03c0 -calculus-A Theory of Mobile Processes","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$ \u03c0 -calculus-A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"5_CR44","unstructured":"Sch\u00fcrr, A., Westfechtel, B.: Graph grammars and graph rewriting systems (in German). Technical report AIB 92\u201315, RWTH Aachen (1992)"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/3-540-45104-8_41","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"G Taentzer","year":"2000","unstructured":"Taentzer, G.: AGG: a tool environment for algebraic graph transformation. In: Nagl, M., Sch\u00fcrr, A., M\u00fcnch, M. (eds.) AGTIVE 1999. LNCS, vol. 1779, pp. 481\u2013488. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45104-8_41"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Wirsing, M.: Algebraic specification. In: van Leeuwen, J. (ed.) Formal Models and Semantics. Handbook of Theoretical Computer Science, vol. B, pp. 675\u2013788. Elsevier (1990). Chapter 13","DOI":"10.1016\/B978-0-444-88074-1.50018-4"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T21:43:26Z","timestamp":1751319806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-75396-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319753959","9783319753966"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75396-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}