Based on a categorical semantics that has been developed recently we study composition and re nement as horizontal and vertical structuring techniques for typed graph transformation systems. Composition of graph transformation systems w.r.t. common subsystems is shown to be compatible with the semantics, i.e., the semantics of the composed system is obtained as the composition of the semantics of the component systems. Moreover, the structure of a composed graph transformation system is preserved during a re nement step in the sense that compatible re nements of the components induce a re nement of the composition. The concepts and results are illustrated by a sample development of a small information system using entity relationship modeling techniques.
al. REF is based on a syntactical relationship between two graph transformation systems.
Horizontal and Vertical Structuring of Typed Graph Transformation Systems
Mathematical Structures in Computer Science
Computer Science Mathematics