| Art der Veröffentlichung: |
Artikel |
| Autor: |
Frank Drewes, Berthold Hoffmann, Detlef Plump |
| Titel: |
Hierarchical Graph Transformation |
| Band: |
64 |
| Seite(n): |
249 – 283 |
| Zeitschrift: |
Journal of Computer and System Science |
| Ausgabe: |
2 |
| Erscheinungsjahr: |
2002 |
| Abstract / Kurzbeschreibung: |
When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible. In this paper, we present an approach for the rule-based tansformation of hierarchically structured hypergraphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. Our framework extends the well-known double-pushout approach from flat to hierarchical graphs. In particular, we show how pushouts and pushout complements of hierarchical graphs and graph morphisms can be constructed recursively. Moreover, we make rules more expressive by introducing variables which allow to copy and to remove hierarchical subgraphs in a single rule application.
|
| PDF Version: |
http://www.informatik.uni-bremen.de/~hof/papers/JCSS02.pdf |
| PostScript Version: |
http://www.informatik.uni-bremen.de/~hof/papers/JCSS02.ps.gz |
| Status: |
Reviewed |
| Letzte Aktualisierung: |
18. 03. 2004 |
