@inproceedings{2aedcb7d826e4b7c83b3a62049309966,
title = "Relabelling in Graph Transformation",
abstract = "The traditional double-pushout approach to graph transformation does not allow to change node labels in an arbitrary context. We propose a simple solution to this problem, namely to use rules with partially labelled interface graphs and to match rules injectively. In [8] we have shown that injective matching makes the double-pushout approach more expressive, and here we further generalise that approach. Besides solving the relabelling problem, our framework allows to write rules with partially labelled left-hand sides which are equivalent to (possibly infinite) sets of rules in the traditional setting. Unlike previous work on rules with partially labelled graphs, we do not need any labelling condition on matching morphisms, nor do we exclude node merging rules.",
author = "Annegret Habel and Detlef Plump",
year = "2002",
doi = "10.1007/3-540-45832-8_12",
language = "English",
isbn = "3-540-44310-X",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "135--147",
editor = "A Corradini and H Ehrig and HJ Kreowski and G Rozenberg",
booktitle = "Proceedings 1st International Conference on Graph Transformation (ICGT 2002)",
address = "Germany",
note = "1st International Conference on Graph Transformation ; Conference date: 07-10-2002 Through 12-10-2002",
}