### Abstract

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.

Original language | English |
---|---|

Title of host publication | Graph Transformation, Specifications, and Nets |

Subtitle of host publication | In Memory of Hartmut Ehrig |

Editors | Reiko Heckel, Gabriele Taentzer |

Publisher | Springer |

Pages | 83-104 |

Number of pages | 22 |

ISBN (Electronic) | 978-3-319-75396-6 |

ISBN (Print) | 978-3-319-75395-9 |

DOIs | |

Publication status | E-pub ahead of print/First online - 7 Feb 2018 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Volume | 10800 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Keywords

- Graph Transformation
- Tutorial

## Fingerprint Dive into the research topics of 'A tutorial on graph transformation'. Together they form a unique fingerprint.

## Cite this

*Graph Transformation, Specifications, and Nets: In Memory of Hartmut Ehrig*(pp. 83-104). (Lecture Notes in Computer Science; Vol. 10800). Springer. https://doi.org/10.1007/978-3-319-75396-6_5