Abstract
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 refinement relations for graph transformation systems in order to support the development of a module concept for graph transformation systems. In a spatial refinement each rule is refined by an amalgamation of rules, in a temporal refinement it is refined by a sequence of rules.
This research has been supported by the TMR Network GETGRATS, ERB-FMRX-CT960061.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E.K. Blum, H. Ehrig, and F. Parisi-Presicce. Algebraic specification of modules and their basic interconnections. JCSS, 34(2–3):293–339, 1987.
P. Böhm, H.-R. Fonio, and A. Habel. Amalgamation of graph transformations: a synchronization mechanism. JCSS, 34:377–408, 1987.
A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and J. Padberg. The category of typed graph grammars and its adjunctions with categories of derivations. In 5th Int. Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94, Springer LNCS 1073, pages 240–256. 1996.
A. Corradini and R. Heckel. A compositional approach to structuring and refinement of typed graph grammars. Proc. of SEGRAGRA'95 ”Graph Rewriting and Computation”, Electronic Notes of TCS, 2, 1995. http://www.elsevier.nl/locate/entcs/volume2.html.
A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26(3,4):241–266, 1996.
H. Ehrig. Introduction to the algebraic theory of graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, 1st Graph Grammar Workshop Springer LNCS 73, pages 1–69. 1979.
H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 2: Module Specifications and Constraints, volume 21 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, Berlin, 1990.
M. Große-Rhode, F. Parisi-Presicce, and M. Simeoni. Concrete spatial refinement constructions for graph transformation systems. Technical Report 97-10, Université di Roma La Sapienza, 1997.
M. Große-Rhode, F. Parisi-Presicce, and M. Simeoni. Spatial and temporal refinement of typed graph transformation systems. Technical Report 97-11, Università di Roma La Sapienza, 1997.
R. Heckel, A. Corradini, H. Ehrig, and M. Löwe. Horizontal and vertical structuring of typed graph transformation systems. MSCS, pages 1–35, 1996.
F. Parisi-Presicce. Transformation of graph grammars. In 5th Int. Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94, Springer LNCS 1073, 1996.
L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, TU Berlin, 1996.
G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific Publishing, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Große-Rhode, M., Parisi-Presicce, F., Simeoni, M. (1998). Spatial and temporal refinement of typed graph transformation systems. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055805
Download citation
DOI: https://doi.org/10.1007/BFb0055805
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64827-7
Online ISBN: 978-3-540-68532-6
eBook Packages: Springer Book Archive