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.
Research supported by the MIUR Project COFIN 2001013518 CoMeta, the FETGC Project IST-2001-32747 Agile and the EC RTN 2-2001-00346 SegraVis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
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.
Edmund M. Clarke, Orna Grumberg, and David E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 1999.
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.
Giorgio Delzanno. Automatic verification of parameterized cache coherence protocols. In Proc. of CAV’00, pages 53–68. Springer-Verlag, 2000. LNCS 1855.
Wilfrid Hodges. Model Theory. Cambridge University Press, 1993.
R. Howell and L. Rosier. Problems concerning fairness and temporal logic for conflict-free Petri net. Theoretical Computer Science, 64:305–329, 1989.
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.
Petr Jancar. Decidability of a temporal logic problem for Petri nets. Theoretical Computer Science, 74:71–93, 1990.
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.
Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag, 1999.
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.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1985.
Abraham Robinson. Introduction to Model Theory and to the Metamathematics of Algebra. North-Holland, 1963.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldan, P., König, B., König, B. (2003). A Logic for Analyzing Abstractions of Graph Transformation Systems. In: Cousot, R. (eds) Static Analysis. SAS 2003. Lecture Notes in Computer Science, vol 2694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44898-5_14
Download citation
DOI: https://doi.org/10.1007/3-540-44898-5_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40325-8
Online ISBN: 978-3-540-44898-3
eBook Packages: Springer Book Archive