Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical structure, and transformation rules are equipped with graph variables. In this paper we analyze conditions under which diverging transformation steps H ⇐ G ⇒ H ′ can be joined by subsequent transformation sequences H ∗ ⇒ M ∗ ⇐ ...

Graph transformation systems support the formal modeling of dynamic, concurrent, and distributed systems. States are given by their graphical structure, and transitions are modeled by graph transformation rules. In this paper we investigate two kinds of reenement relations for graph transformation systems in order to support the development of a module concept for graph transformation systems. ...

This thesis is concerned with the use of graph-transformation rules to specify and manipulate pointer structures. In it, we show that graph transformation can form the basis of a practical and well-formalised approach to specifying pointer properties. We also show that graph transformation rules can be used as an efficient mechanism for checking the properties of graphs. We make context-sensiti...

In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be applied to all or at least some members of a multiset of graphs simultaneously providing a computational step with the possibility of massive parallelism in this way. As a consequence, graph problems in the class NP can...

Software engineers usually represent problems and solutions using graph-based notations at different levels of abstractions. These notations are often semi-formal, but the use of graph transformation techniques can support reasoning about graphs in many ways, and thus can largely enhance them. Recent work indicates many applications of graph transformation to software engineering and opens new ...

• Generalising confluence to up garbage. Critical pair analysis for Back-tracking free recognition of graph languages. The transformation graphs and graph-like structures is ubiquitous in computer science. When a system described by graph-transformation rules, it often desirable that the rules are both terminating confluent so rule applications an arbitrary order produce unique resulting graphs...