Advertisement

A Logic for Analyzing Abstractions of Graph Transformation Systems

  • Paolo Baldan
  • Barbara König
  • Bernhard König
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2694)

Abstract

A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri net-like structures has been recently defined in the literature. In this paper we introduce a monadic second-order logic over graphs expressive enough to characterise typical graph properties, and we show how its formulae can be effectively verified. More specifically, we provide an encoding of such graph formulae into quantifier-free formulae over Petri net markings and we characterise, via a type assignment system, a subclass of formulae F such that the validity of F over a GTS G is implied by the validity of the encoding of F over the Petri net approximation of G. This allows us to reuse existing verification techniques, originally developed for Petri nets, to model-check the logic, suitably enriched with temporal operators.

Keywords

Graph Property Reachable Graph Coverability Graph State Predicate Graph Transformation System 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Paolo Baldan, Andrea Corradini, and Barbara König. A static analysis technique for graph transformation systems. In Proc. of CONCUR’01, pages 381–395. Springer-Verlag, 2001. LNCS 2154.Google Scholar
  2. 2.
    Paolo Baldan and Barbara König. Approximating the behaviour of graph transformation systems. In Proc. of ICGT’02 (International Conference on Graph Transformation), pages 14–29. Springer-Verlag, 2002. LNCS 2505.Google Scholar
  3. 3.
    Edmund M. Clarke, Orna Grumberg, and David E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 1999.Google Scholar
  4. 4.
    B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, Vol.1: Foundations, chapter 5. World Scientific, 1997.Google Scholar
  5. 5.
    Giorgio Delzanno. Automatic verification of parameterized cache coherence protocols. In Proc. of CAV’00, pages 53–68. Springer-Verlag, 2000. LNCS 1855.Google Scholar
  6. 6.
    Wilfrid Hodges. Model Theory. Cambridge University Press, 1993.Google Scholar
  7. 7.
    R. Howell and L. Rosier. Problems concerning fairness and temporal logic for conflict-free Petri net. Theoretical Computer Science, 64:305–329, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Rodney R. Howell, Louis E. Rosier, and Hsu-Chun Yen. A taxonomy of fairness and temporal logic problems for Petri nets. Theoretical Computer Science, 82:341–372, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Petr Jancar. Decidability of a temporal logic problem for Petri nets. Theoretical Computer Science, 74:71–93, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Claire Loiseaux, Susanne Graf, Joseph Sifakis, Ahmed Bouajjani, and Saddek Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:1–35, 1995.CrossRefGoogle Scholar
  11. 11.
    Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag, 1999.Google Scholar
  12. 12.
    Amir Pnueli, Jessie Xu, and Lenore Zuck. Liveness with (0, 1, ∞)-counter abstraction. In Proc. of CAV’ 02, pages 107–122. Springer-Verlag, 2002. LNCS 2404.Google Scholar
  13. 13.
    W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1985.zbMATHGoogle Scholar
  14. 14.
    Abraham Robinson. Introduction to Model Theory and to the Metamathematics of Algebra. North-Holland, 1963.Google Scholar
  15. 15.
    M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. In Proc. of POPL’ 96, pages 16–31. ACM Press, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Paolo Baldan
    • 1
  • Barbara König
    • 2
  • Bernhard König
    • 3
  1. 1.Dipartimento di InformaticaUniversità Ca’ Foscari di VeneziaItaly
  2. 2.Institut für InformatikTechnische Universität MünchenGermany
  3. 3.Department of MathematicsUniversity of CaliforniaIrvineUSA

Personalised recommendations