A Logic for Analyzing Abstractions of Graph Transformation Systems
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.
KeywordsGraph Property Reachable Graph Coverability Graph State Predicate Graph Transformation System
Unable to display preview. Download preview PDF.
- 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.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.Edmund M. Clarke, Orna Grumberg, and David E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 1999.Google Scholar
- 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.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.Wilfrid Hodges. Model Theory. Cambridge University Press, 1993.Google Scholar
- 11.Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag, 1999.Google Scholar
- 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
- 14.Abraham Robinson. Introduction to Model Theory and to the Metamathematics of Algebra. North-Holland, 1963.Google Scholar
- 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