Hans-Jörg Kreowski
Abstract
Abstract.
The aim of the paper is to introduce the notion of a transformation unit together with its interleaving semantics and to study it as a means of constructing large graph transformation systems from small ones in a structured and systematic way. A transformation unit comprises a set of rules, descriptions of initial and terminal graphs, and a control condition. Moreover, it may import other transformation units for structuring purposes. Its semantics is a binary relation between initial and terminal graphs which is given by interleaving sequences. As a generalization of ordinary derivations, an interleaving sequence consists of direct derivation steps interleaved with calls of imported transformation units. It must obey the control condition and may be seen as a kind of structured derivation. The introduced framework is independent of a particular graph transformation approach and, therefore, it may enhance the usefulness of graph transformations in many contexts.
Index Terms
- Graph Transformation Units with Interleaving Semantics
Recommendations
Distributed Graph Transformation Units
ICGT '02: Proceedings of the First International Conference on Graph TransformationTransformation units are a structuring principle for graph transformation systems. In this paper we introduce distributed transformation units that can be used to model distributed graph transformation systems. A distributed transformation unit consists ...
Undecidable Control Conditions in Graph Transformation Units
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in a terminal graph. This transformation process has to obey a so-called ...
Transformation graph G-+-
The transformation graph G^-^+^- of a graph G is the graph with vertex set V(G)@?E(G), in which two vertices u and v are joined by an edge if one of the following conditions holds: (i) u,v@?V(G) and they are not adjacent in G, (ii) u,v@?E(G) and they ...
Comments