Skip to Main content Skip to Navigation

A Rewriting Calculus for Multigraphs with Ports

Oana Andrei 1 Hélène Kirchner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Complete list of metadata
Contributor : Oana Andrei <>
Submitted on : Friday, March 30, 2007 - 2:34:02 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM
Long-term archiving on: : Wednesday, April 7, 2010 - 1:48:25 AM


Files produced by the author(s)


  • HAL Id : inria-00139363, version 1


Oana Andrei, Hélène Kirchner. A Rewriting Calculus for Multigraphs with Ports. [Technical Report] 2007, pp.18. ⟨inria-00139363v1⟩



Record views


Files downloads