Advertisement

Compositional verification of reactive systems specified by graph transformation

  • Reiko Heckel
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1382)

Abstract

A loose semantics for graph transformation rules which has been developed recently is used in this paper for the compositional verification of specifications. The main conceptual tool here is the notion of view, that is, an incomplete specification describing only a certain aspect of the overall system. A view anticipates the (potential) behavior of the complete system by its loose semantics. This ensures that properties of the view are inherited by the complete system.

Based on this result one may verify temporal properties by decomposing a specification into several views, analyzing them separately, and deriving the desired property from properties shown for the views.

Keywords

Graph Transformation Graph Transition Graph Grammar Liveness Property Temporal Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [CMH83]
    K.M. Chandy, J. Misra, and L.M. Haas. Distributed deadlock detection. ACM Transactions on Computer Systems, 1:144–156, May 1983.CrossRefGoogle Scholar
  2. [CMR+97]
    A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, and M. Löwe. Algebraic approaches to graph transformation I: Basic concepts and double pushout approach. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph transformation, Volume 1: Foundations. World Scientific, 1997.Google Scholar
  3. [EHTE97]
    G. Engels, R. Heckel, G. Taentzer, and H. Ehrig. A view-oriented approach to system modelling based on graph transformation. In Proc. of ESEC/FSE'97, Zürich, Springer LNCS 1301, 1997. Extended version to appear in International Journal of Software Engineering and Knowledge Engineering, 1998.Google Scholar
  4. [EM85]
    H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, Berlin, 1985.Google Scholar
  5. [EPS73]
    H. Ehrig, M. Pfender, and H.J. Schneider. Graph grammars: an algebraic approach. In 14th Annual IEEE Symposium on Switching and Automata Theory, pages 167–180. IEEE, 1973.Google Scholar
  6. [FKN+92]
    A. Finkelstein, J. Kramer, B. Nuseibeh, M. Goedicke, and L. Finkelstein. Viewpoints: A framework for integrating multiple perspectives in system development. International Journal of Software Engineering and Knowledge Engineering, 2(1):31–58, March 1992.CrossRefGoogle Scholar
  7. [GHK]
    F. Gadducci, R. Heckel, and M. Koch. Combining graph transformations with temporal logic. In First TMR GETGRATS Workshop, Bordeaux, October 1997.Google Scholar
  8. [GR97]
    M. Grö\e-Rhode. Algebra transformation systems and their composition. In this volume.Google Scholar
  9. [HCEL96]
    R. Heckel, A. Corradini, H. Ehrig, and M. Löwe. Horizontal and vertical structuring of typed graph transformation systems. Math. Struc. in Comp. Science, 6(6):613–648, 1996. Also Techn. Rep. 96–22, TU Berlin.Google Scholar
  10. [HEWC97a]
    R. Heckel, H. Ehrig, U. Wolter, and A. Corradini. Integrating the specification techniques of graph transformation and temporal logic. In Proc. of MFCS'97, Bratislava, Springer LNCS 1295, 1997.Google Scholar
  11. [HEWC97b]
    R. Heckel, H. Ehrig, U. Wolter, and A. Corradini. Loose semantics and constraints for graph transformation systems. Techn. Rep. 97–07, TU Berlin, 1997. http://www.cs.tu-berlin.de/cs/ifb/TechnBerichteListe.html.Google Scholar
  12. [HHT96]
    A. Habel, R. Heckel, and G. Taentzer. Graph grammars with negative application conditions. Fundamenta Informaticae, 26(3,4), 1996.Google Scholar
  13. [HW95]
    R. Heckel and A. Wagner. Ensuring consistency of conditional graph grammars — a constructive approach. Proc. of SEGRAGRA'95 ”Graph Rewriting and Computation”, Electronic Notes of TCS, 2, 1995. http://www.elsevier.nl/locate/entcs/volume2.html.Google Scholar
  14. [Löw93]
    M. Löwe. Algebraic approach to single-pushout graph transformation. TCS, 109:181–224, 1993.zbMATHCrossRefGoogle Scholar
  15. [MP92]
    Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer-Verlag, 1992.Google Scholar
  16. [Sch94]
    Enno Scholz. Verteilte Betriebssysteme. Seminar notes at the graduate college “Communication-based Systems”, TU Berlin, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Reiko Heckel
    • 1
  1. 1.Dipartimento di InformatikaUniversità degli Studi di PisaPisaItalia

Personalised recommendations