Drewes, F., Hoffmann, B. and Plump, D. (2002) Hierarchical graph transformation. Journal of Computer and System Sciences, 64 (2). pp. 249-283. ISSN 0022-0000Full text not available from this repository.
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.
|Institution:||The University of York|
|Academic Units:||The University of York > Computer Science (York)|
|Depositing User:||York RAE Import|
|Date Deposited:||23 Apr 2009 14:58|
|Last Modified:||23 Apr 2009 14:58|
|Publisher:||Elsevier Science B.V.|