Spatial and temporal refinement relations between typed graph transformation systems have been introduced in [6,7]. In a spatial refinement a transformation rule is refined by an amalgamation of rules while in a temporal refinement it is refined by a sequence of rules: in both cases, the refinement relation supports the modeling of implementation. In the first part of this paper, we further investigate the properties of spatial and temporal refinements while, in the second part, we employ them for the development of a module concept for typed graph transfor-mation systems. Finally, as a first step towards an algebra of modules, we introduce the operations of union and composition of modules.
Refinements and Modules for Typed Graph Transformation Systems
SIMEONI, Marta
1999-01-01
Abstract
Spatial and temporal refinement relations between typed graph transformation systems have been introduced in [6,7]. In a spatial refinement a transformation rule is refined by an amalgamation of rules while in a temporal refinement it is refined by a sequence of rules: in both cases, the refinement relation supports the modeling of implementation. In the first part of this paper, we further investigate the properties of spatial and temporal refinements while, in the second part, we employ them for the development of a module concept for typed graph transfor-mation systems. Finally, as a first step towards an algebra of modules, we introduce the operations of union and composition of modules.
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
