Graph rewriting

Short description: Creating a new graph from an existing graph

In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from software engineering (software construction and also software verification) to layout algorithms and picture generation.

Graph transformations can be used as a computation abstraction. The basic idea is that if the state of a computation can be represented as a graph, further steps in that computation can then be represented as transformation rules on that graph. Such rules consist of an original graph, which is to be matched to a subgraph in the complete state, and a replacing graph, which will replace the matched subgraph.

Formally, a graph rewriting system usually consists of a set of graph rewrite rules of the form [math]\displaystyle{ L \rightarrow R }[/math], with [math]\displaystyle{ L }[/math] being called pattern graph (or left-hand side) and [math]\displaystyle{ R }[/math] being called replacement graph (or right-hand side of the rule). A graph rewrite rule is applied to the host graph by searching for an occurrence of the pattern graph (pattern matching, thus solving the subgraph isomorphism problem) and by replacing the found occurrence by an instance of the replacement graph. Rewrite rules can be further regulated in the case of labeled graphs, such as in string-regulated graph grammars.

Sometimes graph grammar is used as a synonym for graph rewriting system, especially in the context of formal languages; the different wording is used to emphasize the goal of constructions, like the enumeration of all graphs from some starting graph, i.e. the generation of a graph language – instead of simply transforming a given state (host graph) into a new state.

Graph rewriting approaches

Top: Example graph rewrite rule (optimization from compiler construction: multiplication with 2 replaced by addition). Bottom: Application of the rule to optimize "y=x*2" into "y=x+x".

Algebraic approach

The algebraic approach to graph rewriting is based upon category theory. The algebraic approach is further divided into sub-approaches, the most common of which are the double-pushout (DPO) approach and the single-pushout (SPO) approach. Other sub-approaches include the sesqui-pushout and the pullback approach.

From the perspective of the DPO approach a graph rewriting rule is a pair of morphisms in the category of graphs and graph homomorphisms between them: [math]\displaystyle{ r = (L \leftarrow K \rightarrow R) }[/math], also written [math]\displaystyle{ L \supseteq K \subseteq R }[/math], where [math]\displaystyle{ K \rightarrow L }[/math] is injective. The graph K is called invariant or sometimes the gluing graph. A rewriting step or application of a rule r to a host graph G is defined by two pushout diagrams both originating in the same morphism [math]\displaystyle{ k\colon K\rightarrow D }[/math], where D is a context graph (this is where the name double-pushout comes from). Another graph morphism [math]\displaystyle{ m\colon L\rightarrow G }[/math] models an occurrence of L in G and is called a match. Practical understanding of this is that [math]\displaystyle{ L }[/math] is a subgraph that is matched from [math]\displaystyle{ G }[/math] (see subgraph isomorphism problem), and after a match is found, [math]\displaystyle{ L }[/math] is replaced with [math]\displaystyle{ R }[/math] in host graph [math]\displaystyle{ G }[/math] where [math]\displaystyle{ K }[/math] serves as an interface, containing the nodes and edges which are preserved when applying the rule. The graph [math]\displaystyle{ K }[/math] is needed to attach the pattern being matched to its context: if it is empty, the match can only designate a whole connected component of the graph [math]\displaystyle{ G }[/math].

In contrast a graph rewriting rule of the SPO approach is a single morphism in the category of labeled multigraphs and partial mappings that preserve the multigraph structure: [math]\displaystyle{ r\colon L\rightarrow R }[/math]. Thus a rewriting step is defined by a single pushout diagram. Practical understanding of this is similar to the DPO approach. The difference is, that there is no interface between the host graph G and the graph G' being the result of the rewriting step.

From the practical perspective, the key distinction between DPO and SPO is how they deal with the deletion of nodes with adjacent edges, in particular, how they avoid that such deletions may leave behind "dangling edges". The DPO approach only deletes a node when the rule specifies the deletion of all adjacent edges as well (this dangling condition can be checked for a given match), whereas the SPO approach simply disposes the adjacent edges, without requiring an explicit specification.

There is also another algebraic-like approach to graph rewriting, based mainly on Boolean algebra and an algebra of matrices, called matrix graph grammars.

Determinate graph rewriting

Yet another approach to graph rewriting, known as determinate graph rewriting, came out of logic and database theory. In this approach, graphs are treated as database instances, and rewriting operations as a mechanism for defining queries and views; therefore, all rewriting is required to yield unique results (up to isomorphism), and this is achieved by applying any rewriting rule concurrently throughout the graph, wherever it applies, in such a way that the result is indeed uniquely defined.

Term graph rewriting

Another approach to graph rewriting is term graph rewriting, which involves the processing or transformation of term graphs (also known as abstract semantic graphs) by a set of syntactic rewrite rules.

Term graphs are a prominent topic in programming language research since term graph rewriting rules are capable of formally expressing a compiler's operational semantics. Term graphs are also used as abstract machines capable of modelling chemical and biological computations as well as graphical calculi such as concurrency models. Term graphs can perform automated verification and logical programming since they are well-suited to representing quantified statements in first order logic. Symbolic programming software is another application for term graphs, which are capable of representing and performing computation with abstract algebraic structures such as groups, fields and rings.

The TERMGRAPH conference focuses entirely on research into term graph rewriting and its applications.

Classes of graph grammar and graph rewriting system

Graph rewriting systems naturally group into classes according to the kind of representation of graphs that are used and how the rewrites are expressed. The term graph grammar, otherwise equivalent to graph rewriting system or graph replacement system, is most often used in classifications. Some common types are:

• Attributed graph grammars, typically formalised using either the single-pushout approach or the double-pushout approach to characterising replacements, mentioned in the above section on the algebraic approach to graph rewriting.
• Hypergraph grammars, including as more restrictive subclasses port graph grammars, linear graph grammars and interaction nets.

Implementations and applications

Graphs are an expressive, visual and mathematically precise formalism for modelling of objects (entities) linked by relations; objects are represented by nodes and relations between them by edges. Nodes and edges are commonly typed and attributed. Computations are described in this model by changes in the relations between the entities or by attribute changes of the graph elements. They are encoded in graph rewrite/graph transformation rules and executed by graph rewrite systems/graph transformation tools.

• Tools that are application domain neutral:
  • AGG, the attributed graph grammar system (Java).
  • GP 2 is a visual rule-based graph programming language designed to facilitate formal reasoning over graph programs.
  • GMTE, the Graph Matching and Transformation Engine for graph matching and transformation. It is an implementation of an extension of Messmer’s algorithm using C++.
  • GrGen.NET, the graph rewrite generator, a graph transformation tool emitting C#-code or .NET-assemblies.
  • GROOVE, a Java-based tool set for editing graphs and graph transformation rules, exploring the state spaces of graph grammars, and model checking those state spaces; can also be used as a graph transformation engine.
  • Verigraph, a software specification and verification system based on graph rewriting (Haskell).
• Tools that solve software engineering tasks (mainly MDA) with graph rewriting:
  • eMoflon, an EMF-compliant model-transformation tool with support for Story-Driven Modeling and Triple Graph Grammars.
  • EMorF a graph rewriting system based on EMF, supporting in-place and model-to-model transformation.
  • Fujaba uses Story driven modelling, a graph rewrite language based on PROGRES.
  • Graph databases often support dynamic rewriting of graphs.
  • GReAT.
  • Gremlin, a graph-based programming language (see Graph Rewriting).
  • Henshin, a graph rewriting system based on EMF, supporting in-place and model-to-model transformation, critical pair analysis, and model checking.
  • PROGRES, an integrated environment and very high level language for PROgrammed Graph REwriting Systems.
  • VIATRA.
• Mechanical engineering tools
  • GraphSynth is an interpreter and UI environment for creating unrestricted graph grammars as well as testing and searching the resultant language variant. It saves graphs and graph grammar rules as XML files and is written in C#.
  • Soley Studio, is an integrated development environment for graph transformation systems. Its main application focus is data analytics in the field of engineering.
• Biology applications
  • Functional-structural plant modeling with a graph grammar based language
  • Multicellular development modeling with string-regulated graph grammars
• Artificial Intelligence/Natural Language Processing
  • OpenCog provides a basic pattern matcher (on hypergraphs) which is used to implement various AI algorithms.
  • RelEx is an English-language parser that employs graph re-writing to convert a link parse into a dependency parse.
• Computer programming language
  • The Clean programming language is implemented using graph rewriting.

See also

• Graph theory
• Shape grammar
• Formal grammar
• Abstract rewriting — a generalization of graph rewriting

References

Sources

• Rozenberg, Grzegorz (1997), Handbook of Graph Grammars and Computing by Graph Transformations, 1–3, World Scientific Publishing, ISBN 9810228848, http://www.informatik.uni-trier.de/~ley/db/conf/gg/handbook1997.html .
• Perez, P.P. (2009), Matrix Graph Grammars: An Algebraic Approach to Graph Dynamics, VDM Verlag, ISBN 978-3-639-21255-6 .
• Heckel, R. (2006). Graph transformation in a nutshell. Electronic Notes in Theoretical Computer Science 148 (1 SPEC. ISS.), pp. 187–198.
• König, Barbara (2004). Analysis and Verification of Systems with Dynamically Evolving Structure. Habilitation thesis, Universität Stuttgart, pp. 65–180.
• Lobo, Daniel; Vico, Francisco J.; Dassow, Jürgen (2011-10-01). "Graph grammars with string-regulated rewriting". Theoretical Computer Science 412 (43): 6101–6111. doi:10.1016/j.tcs.2011.07.004. ISSN 0304-3975. 
• Grzegorz Rozenberg, ed (Feb 1997). Foundations. Handbook of Graph Grammars and Computing by Graph Transformation. 1. World Scientific. doi:10.1142/3303. ISBN 978-981-02-2884-2. https://www.worldscientific.com/worldscibooks/10.1142/3303. 
• Applications, Languages and Tools. Handbook of Graph Grammars and Computing by Graph Transformation. 2. World Scientific. Oct 1999. doi:10.1142/4180. ISBN 978-981-02-4020-2. https://www.worldscientific.com/worldscibooks/10.1142/4180. 
• Concurrency, Parallelism, and Distribution. Handbook of Graph Grammars and Computing by Graph Transformation. 3. World Scientific. Aug 1999. doi:10.1142/4181. ISBN 978-981-02-4021-9. https://www.worldscientific.com/worldscibooks/10.1142/4181.