Skip to Main content Skip to Navigation
Conference papers

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, called rho-mg calculus.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00139363
Contributor : Oana Andrei <>
Submitted on : Monday, May 21, 2007 - 4:11:02 PM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM
Long-term archiving on: : Monday, October 22, 2012 - 12:05:31 PM

File

2nd-hal-rewmgraphs.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00139363, version 2

Collections

Citation

Oana Andrei, Hélène Kirchner. A Rewriting Calculus for Multigraphs with Ports. The Eighth International Workshop on Rule-Based Programming (RULE 2007), Jun 2007, Paris, France. pp.20. ⟨inria-00139363v2⟩

Share

Metrics

Record views

443

Files downloads

257