AGREE - Algebraic Graph Rewriting with Controlled Embedding - Laboratoire d'Informatique de Grenoble Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

AGREE - Algebraic Graph Rewriting with Controlled Embedding

Résumé

The several algebraic approaches to graph transformation proposed in the literature all ensure that if an item is preserved by a rule, so are its connections with the context graph where it is embedded. But there are applications in which it is desirable to specify different embeddings. For example when cloning an item, there may be a need to handle the original and the copy in different ways. We propose a conservative extension of classical algebraic approaches to graph transformation, for the case of monic matches, where rules allow one to specify how the embedding of preserved items should be carried out.

Dates et versions

hal-01403189 , version 1 (25-11-2016)

Identifiants

Citer

Andrea Corradini, Dominique Duval, Rachid Echahed, Frederic Prost, Leila Ribeiro. AGREE - Algebraic Graph Rewriting with Controlled Embedding. ICGT 2015 - 8th International Conference on Graph Transformation, Jul 2015, L'Aquila, Italy. pp.35-51, ⟨10.1007/978-3-319-21145-9_3⟩. ⟨hal-01403189⟩
228 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More