Graph transformation systems are formal models of computational systems, specified by rules that describe the atomic steps of the system. A refinement of a graph transformation system is given by associating with each of its rules a composition of rules of a refining system, that has the same visible effect as the original rule. The basic composition operations on graph transformation rules are sequential and parallel composition, corresponding to temporal and spatial refinements respectively. Syntactically refinements are represented by rule expressions that describe how the refining rules shall be composed.
Refinements of Graph Transformation Systems via Rule Expressions
SIMEONI, Marta
2000-01-01
Abstract
Graph transformation systems are formal models of computational systems, specified by rules that describe the atomic steps of the system. A refinement of a graph transformation system is given by associating with each of its rules a composition of rules of a refining system, that has the same visible effect as the original rule. The basic composition operations on graph transformation rules are sequential and parallel composition, corresponding to temporal and spatial refinements respectively. Syntactically refinements are represented by rule expressions that describe how the refining rules shall be composed.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
