Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules. From process algebra, on the other hand, we know the principle of reactivity, meaning that the system being modelled is embedded in an environment with which it continually interacts. This has the advantage of allowi...

Graph transformation units are rule-based devices to model and compute relations between initial and terminal graphs. In this paper, they are generalized to graph tuple transformation units that allow one to combine different kinds of graphs into tuples and to process the component graphs simultaneously and interrelated with each other. Moreover, one may choose some of the working components as...

Graph transformation, a branch of theoretical computer science, is about the definition of graph languages by grammars, and the study of computations on graphs by rewrite rules. In this paper, we sketch a software engineering problem – the refactoring of object-oriented software – and indicate how graph grammars and graph rewrite rules can be extended for specifying and implementing refactoring...

The transformation graph G++− of G is the graph with vertex set V (G)∪ E(G) in which the vertices u and v are joined by an edge if one of the following conditions holds: (i) u, v ∈ V (G) and they are adjacent in G, (ii) u, v ∈ E(G) and they are adjacent in G, (iii) one of u and v is in V (G) while the other is in E(G), and they are not incident in G. In this paper, for a graph G, we determine t...

In this work we consider the question how attributed graph transformation can be distributed over a network. Among several attribution concepts for graph transformation in the literature we choose the description of data and data operations by partial algebras leading to a powerful and exible attribution of graph transformation. Distributing it over a network, the communication between network ...

We introduce an extension of Graph Grammars (GGs), called Dynamic Graph Grammars (DynGGs), where the right-hand side of a production can spawn fresh parts of the type graph and fresh productions operating on it. The features of DynGGs make them suitable for the straightforward modeling of reflexive mobile systems like dynamic nets and the Join calculus. Our main result shows that each DynGG can...

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 fla...