Refinements and Modules for Typed Graph Transformation Systems

Authors:
Martin Große-Rhode;Francesco Parisi-Presicce;Marta Simeoni
Affiliations:
-;-;-
Venue:
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Year:
1998

Citing 5
Cited 4

Algebraic specification of modules and their basic interconnections

Journal of Computer and System Sciences
A view-oriented approach to system modelling based on graph transformation

ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
Spatial and Temporal Refinement of Typed Graph Transformation Systems

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Transformations of Graph Grammars

Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
On the Interleaving Sematics of Transformation Units - A Step into GRACE

Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science

Graph Transformation Modules and Their Composition

AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
Graph Transformation Units --- An Overview

Concurrency, Graphs and Models
Flexible interconnection of graph transformation modules

Formal Methods in Software and Systems Modeling
Property preserving redesign of specifications

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 transformation systems. Finally, as a first step towards an algebra of modules, we introduce the operations of union and composition of modules.