A Rewriting Calculus for Multigraphs with Ports - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

A Rewriting Calculus for Multigraphs with Ports

Résumé

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.
Fichier principal
Vignette du fichier
2nd-hal-rewmgraphs.pdf (396.23 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00139363 , version 1 (30-03-2007)
inria-00139363 , version 2 (21-05-2007)

Identifiants

  • HAL Id : inria-00139363 , version 2

Citer

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⟩
369 Consultations
302 Téléchargements

Partager

Gmail Facebook X LinkedIn More