Hierarchical graph transformation

  • Authors:
  • Frank Drewes;Berthold Hoffmann;Detlef Plump

  • Affiliations:
  • Institutionen för Datavetenskap, Umea Universitet, S-90187 Umea, Sweden;Fachbereieh Mathematik/Informatik, Universität Bremen, Postfach 33 04 40, D-28334 Bremen, Germany;Department of Computer Science, The University of York, York YO10 5DD, United Kingdom

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 transformation 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 us to copy and remove hierarchical subgraphs in a single rule application.