Spatial and temporal refinement of typed graph transformation systems

  • Martin Große-Rhode
  • Francesco Parisi-Presicce
  • Marta Simeoni
Contributed Papers Graphs and Hypergraphs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1450)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BEP87]
    E.K. Blum, H. Ehrig, and F. Parisi-Presicce. Algebraic specification of modules and their basic interconnections. JCSS, 34(2–3):293–339, 1987.MATHMathSciNetGoogle Scholar
  2. [BFH87]
    P. Böhm, H.-R. Fonio, and A. Habel. Amalgamation of graph transformations: a synchronization mechanism. JCSS, 34:377–408, 1987.MATHGoogle Scholar
  3. [CEL+96]
    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.Google Scholar
  4. [CH95]
    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.Google Scholar
  5. [CMR96]
    A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26(3,4):241–266, 1996.MATHMathSciNetGoogle Scholar
  6. [Ehr79]
    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.Google Scholar
  7. [EM90]
    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.Google Scholar
  8. [GPS97a]
    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.Google Scholar
  9. [GPS97b]
    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.Google Scholar
  10. [HCEL96]
    R. Heckel, A. Corradini, H. Ehrig, and M. Löwe. Horizontal and vertical structuring of typed graph transformation systems. MSCS, pages 1–35, 1996.Google Scholar
  11. [Par96]
    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.Google Scholar
  12. [Rib96]
    L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, TU Berlin, 1996.Google Scholar
  13. [Roz97]
    G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific Publishing, 1997.Google Scholar

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Martin Große-Rhode
    • 1
  • Francesco Parisi-Presicce
    • 2
  • Marta Simeoni
    • 2
  1. 1.Dip. di InformaticaUniversitá di PisaPisaItaly
  2. 2.Dip. Scienze dell'InformazioneUniversité di Roma La SapienzaRomeItaly

Personalised recommendations