The AGREE approach to graph transformation allows to specify rules that clone items of the host graph, controlling in a finegrained way how to deal with the edges that are incident, but not matched, to the rewritten part of the graph. Here, we investigate in which ways cloning (with controlled embedding) may affect the dependencies between two rules applied to the same graph. We extend to AGREE the classical notion of parallel independence between the matches of two rules to the same graph, identifying sufficient conditions that guarantee that two rules can be applied in any order leading to the same result.
Parallelism in AGREE transformations
CORRADINI, ANDREA;
2016-01-01
Abstract
The AGREE approach to graph transformation allows to specify rules that clone items of the host graph, controlling in a finegrained way how to deal with the edges that are incident, but not matched, to the rewritten part of the graph. Here, we investigate in which ways cloning (with controlled embedding) may affect the dependencies between two rules applied to the same graph. We extend to AGREE the classical notion of parallel independence between the matches of two rules to the same graph, identifying sufficient conditions that guarantee that two rules can be applied in any order leading to the same result.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
2016-LNCS-POST-ICGT-ParallelismInAGREE.pdf
accesso aperto
Tipologia:
Documento in Post-print
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.49 MB
Formato
Adobe PDF
|
1.49 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.