Martin Große-Rhode

Learn More
Spatial and temporal reenement relations between typed graph transformation systems have been introduced in 6, 7]. In a spatial reenement each rule is reened by an amalgamation of rules while in a temporal reenement it is reened by a sequence of rules: in both cases, the reenement relation supports the modeling of implementation. In the rst part of this(More)
Graph transformation systems support the formal modeling of dynamic, concurrent, and distributed systems. States are given by their graphical structure, and transitions are modeled by graph transformation rules. In this paper we investigate two kinds of reenement relations for graph transformation systems in order to support the development of a module(More)