A Rewriting Calculus for Multigraphs with Ports

In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of these structures is expressed with multigraph rewrite rules and a multigraph rewriting relation. Then we encode the multigraphs and multigraph rewriting using algebraic terms and term rewriting to provide an operational semantics of the multigraph rewriting relation. This term version can be embedded in the rewriting calculus, thus defining for labeled multigraph transformations a high-level pattern calculus, called mg-calculus.

• Type: Journal
• Year: 2008
• Where: ENTCS
• Authors: Oana Andrei, Hélène Kirchner
• Keywords: ENTCS 2008, Multigraph Rewriting, Multigraph Rewriting Relation, Term Rewriting