Horizontal and vertical structuring of typed graph transformation systems
- 1 December 1996
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 6 (6) , 613-648
- https://doi.org/10.1017/s0960129500070110
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.Keywords
This publication has 19 references indexed in Scilit:
- ALGEBRAIC APPROACHES TO GRAPH TRANSFORMATION – PART II: SINGLE PUSHOUT APPROACH AND COMPARISON WITH DOUBLE PUSHOUT APPROACHPublished by World Scientific Pub Co Pte Ltd ,1997
- ALGEBRAIC APPROACHES TO GRAPH TRANSFORMATION – PART I: BASIC CONCEPTS AND DOUBLE PUSHOUT APPROACHPublished by World Scientific Pub Co Pte Ltd ,1997
- Transformations of graph grammarsPublished by Springer Nature ,1996
- DIEGO, Another Step Towards a Module Concept for Graph Transformation SystemsElectronic Notes in Theoretical Computer Science, 1995
- Ensuring Consistency of Conditional Graph Grammars - A Constructive Approach -Electronic Notes in Theoretical Computer Science, 1995
- Algebraic high-level net transformation systemsMathematical Structures in Computer Science, 1995
- Algebraic approach to single-pushout graph transformationTheoretical Computer Science, 1993
- A categorical manifestoMathematical Structures in Computer Science, 1991
- Petri nets are monoidsInformation and Computation, 1990
- Separable graphs, planar graphs and web grammarsInformation and Control, 1970