Abstract
We present an approach for the rule-based transformation of hierarchically structured (hyper)graphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. Our framework extends the double-pushout approach from flat to hierarchical graphs. In particular, we show how to construct recursively pushouts and pushout complements of hierarchical graphs and graph morphisms. To further enhance the expressiveness of the approach, we also introduce rule schemata with variables which allow to copy and to remove hierarchical subgraphs. © Springer-Verlag Berlin Heidelberg 2000.
Cite
CITATION STYLE
Drewes, F., Hoffmann, B., & Plump, D. (2000). Hierarchical graph transformation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1784 LNCS, pp. 98–113). Springer Verlag. https://doi.org/10.1007/3-540-46432-8_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
