König, Barbara; Nolte, Dennis; Padberg, Julia; Rensink, Arend A tutorial on graph transformation. (English) Zbl 1383.68044 Heckel, Reiko (ed.) et al., Graph transformation, specifications, and nets. In memory of Hartmut Ehrig. Cham: Springer (ISBN 978-3-319-75395-9/pbk; 978-3-319-75396-6/ebook). Lecture Notes in Computer Science 10800, 83-104 (2018). Summary: Graph transformation or graph rewriting has been developed for nearly 50 years and has become a mature and manifold formal technique. Basically, rewrite rules are used to manipulate graphs. These rules are given by a left-hand side and a right-hand side graph and the application comprises matching the left-hand side and replacing it with the right-hand side of the rule.In this contribution we give a tutorial on graph transformation that explains the so-called double-pushout approach to graph transformation in a rigorous, but non-categorical way, using a gluing construction. We explicate the definitions with several small examples.We also introduce attributes and attributed graph transformation in a lightweight form. The paper is concluded by a more extensive example on a leader election protocol, the description of tool support and pointers to related work.For the entire collection see [Zbl 1383.68006]. Cited in 4 Documents MSC: 68Q42 Grammars and rewriting systems PDFBibTeX XMLCite \textit{B. König} et al., Lect. Notes Comput. Sci. 10800, 83--104 (2018; Zbl 1383.68044) Full Text: DOI Link