Hierarchical Graph Transformation

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

  • Affiliations:
  • -;-;-

  • Venue:
  • FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

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.