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 control condition, i.e. the device to select how rules or imported transformation units are to be combined in the transformation process executed by...

Graph transformation (GT) frequently serves as a precise underlying specification mechanism for model transformations within and between modeling languages. However, composability of graph transformation rules is typically limited to inter-level rule composition (i.e. rules calling other rules). In the current paper, we introduce intra-level composition for GT rules where the left-hand side and...

The issue of confluence is of major importance for the successful application of attributed graph transformation, such as automated translation of UML models into semantic domains. Whereas termination is undecidable in general and must be established by carefully designing the rules, local confluence can be shown for term rewriting and graph rewriting using the concept of critical pairs. In thi...

Graph transformation units are rule-based devices to model graph algorithms, graph processes, and the dynamics of systems the states of which are represented by graphs. Given a graph, various rules are applicable at various matches in general, but not any choice leads to a proper result so that one faces the problem of nondeterminism. As countermeasure, graph transformation units provide the ge...

The integrated development environment AGG supports the specification of algebraic graph transformation systems based on attributed, typed graphs with node type inheritance, graph rules with application conditions, and graph constraints. It offers several analysis techniques for graph transformation systems including graph parsing, consistency checking of graphs as well as conflict and dependen...

In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produces a finite structure consisting of a hypergraph decorated with transitions (Petri graph) which can be seen as an approximation of the Winskel style unfolding of the graph transformation system. The fact that any rea...

The main aim of this contribution is to give an overview concerning applications of graph transformation techniques to the area of Petri nets achieved by the team of TU Berlin within the APPLIGRAPH Working Group and the DFG Researcher Group on Petri Net Technology. Since about 10 years the strong relationships between the areas of Petri nets and graph transformation systems have been studied es...