Editing Graph rewriting (section)

==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:
** [https://web.archive.org/web/20110217171142/http://user.cs.tu-berlin.de/~gragra/agg/ AGG], the attributed graph grammar system ([[Java (programming language)|Java]]).
** [https://uoycs-plasma.github.io/GP2/ GP 2] is a visual rule-based graph programming language designed to facilitate formal reasoning over graph programs.
** [http://homepages.laas.fr/khalil/GMTE/ GMTE] {{Webarchive|url=https://web.archive.org/web/20180313184934/http://homepages.laas.fr/khalil/GMTE/ |date=2018-03-13 }}, 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|GrGen.NET]], the graph rewrite generator, a graph transformation tool emitting [[C Sharp (programming language)|C#]]-code or .NET-assemblies.
** [http://groove.cs.utwente.nl/ 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.
** [https://github.com/Verites/verigraph/ Verigraph], a software specification and verification system based on graph rewriting ([[Haskell (programming language)|Haskell]]).
* Tools that solve [[software engineering]] tasks (mainly [[Model-driven architecture|MDA]]) with graph rewriting:
** [http://emoflon.org/ eMoflon], an EMF-compliant model-transformation tool with support for [[Story-driven modeling|Story-Driven Modeling]] and Triple Graph Grammars.
** {{usurped|1=[https://web.archive.org/web/20160422081445/http://www.emorf.org/ EMorF]}} a graph rewriting system based on [[Eclipse Modeling Framework|EMF]], supporting in-place and model-to-model [[model transformation|transformation]].
** [http://www.fujaba.de/ Fujaba] uses Story driven modelling, a graph rewrite language based on PROGRES.
** [[Graph Database|Graph databases]] often support dynamic rewriting of graphs.
** [[GReAT]].
** [http://tinkerpop.apache.org/gremlin.html Gremlin], a graph-based programming language (see [https://github.com/tinkerpop/gremlin/wiki/Graph-Rewriting Graph Rewriting]).
** [https://www.eclipse.org/henshin/ Henshin],  a graph rewriting system based on [[Eclipse Modeling Framework|EMF]], supporting in-place and model-to-model [[model transformation|transformation]], [[critical pair (logic)|critical pair analysis]], and [[model checking]].
** [http://www.se.rwth-aachen.de/tikiwiki/tiki-index.php%3Fpage=Research%3A+Progres.html PROGRES], an integrated environment and very high level language for PROgrammed Graph REwriting Systems.
** [[VIATRA]].
* Mechanical engineering tools
** [http://www.graphsynth.com 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 Sharp (programming language)|C#]].
** [https://archive.today/20150317152250/https://www.soley-technology.com/en/pr-soley-studio 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
** [https://grogra.de/ Functional-structural plant modeling with a graph grammar based language]
** [https://dx.doi.org/10.1016/j.tcs.2011.07.004 Multicellular development modeling with string-regulated graph grammars]
** [https://kappalanguage.org/ Kappa] is a rule-based language for modeling systems of interacting agents, primarily motivated by molecular systems biology.
* Artificial Intelligence/Natural Language Processing
** [[OpenCog]] provides a basic pattern matcher (on [[hypergraph]]s) which is used to implement various AI algorithms.
** [http://wiki.opencog.org/w/RelEx RelEx] is an English-language parser that employs graph re-writing to convert a [[link grammar|link parse]] into a [[dependency grammar|dependency parse]].
* Computer programming language
** The [[Clean programming language]] is implemented using graph rewriting.