Graph rewriting with polarized cloning - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2009

Graph rewriting with polarized cloning

Rachid Echahed

Résumé

We tackle the problem of graph transformation with a particular focus on node cloning. We propose a graph rewriting framework where nodes can be cloned zero, one or more times. A node can be cloned together with all its incident edges, with only the outgoing edges, with only the incoming edges or without any of the incident edges. We thus subsume previous works such as the sesqui-pushout, the heterogeneous pushout and the adaptive star grammars approaches. A rule is defined as a span $\mathbb{L} \stackrel{l}{\longleftarrow} \mathbb{K} \stackrel{r}{\longrightarrow} R$ where the right-hand side $R$ is a multigraph, the left-hand side $\mathbb{L}$ and the interface $\mathbb{K}$ are polarized multigraphs. A polarized multigraph is a multigraph endowed with some cloning annotations on nodes and edges. We introduce the notion of polarized multigraphs and define a rewriting step as pushback followed by a pushout in the same way as in the sesqui-pushout approach.
Fichier principal
Vignette du fichier
Graph_Polarized_V2.pdf (366.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00433379 , version 1 (19-11-2009)
hal-00433379 , version 2 (13-01-2010)

Identifiants

Citer

Dominique Duval, Rachid Echahed, Frédéric Prost. Graph rewriting with polarized cloning. 2009. ⟨hal-00433379v2⟩
200 Consultations
138 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More