Author:
Heckel Reiko,Corradini Andrea,Ehrig Hartmut,Löwe Michael
Abstract
Using a categorical semantics that has been developed recently as a basis, we study composition and refinement as horizontal and vertical structuring techniques for typed graph transformation systems. Composition of graph transformation systems with respect to 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 refinement step in the sense that compatible refinements of the components induce a refinement of the composition. The concepts and results are illustrated by a sample development of a small information system using entity relationship modelling techniques.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献