Abstract
In this paper we present an efficient technique for symbolic model checking of any CTL formula with respect to a state/event system. Such a system is a concurrent version of a Mealy machine and is used to describe embedded reactive systems. The technique uses compositionality to find increasingly better upper and lower bounds of the solution to a CTL formula until an exact answer is found. Experiments show this approach to succeed on examples larger than the standard backwards traversal can handle, and even in many cases where both methods succeed it is shown to be faster.
Chapter PDF
References
F. Balarin and A.L. Sangiovanni-Vincentelli. An iterative approach to language containment. In C. Courcoubetis, editor, CAV’93. 5th International Conference on Computer Aided Verification, volume 697 of LNCS, pages 29–40, Berlin, 1993. Springer-Verlag.
Randal E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.
Randal E. Bryant. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3):293–318, September 1992.
J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P. B. Denyer, editors, Proc. 1991 Int. Conf. on VLSI, August 1991.
William Chan, Richard J. Anderson, Paul Beame, and David Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA-98), volume 23,2 of ACM Software Engineering Notes, pages 102–112, New York, March2-5 1998. ACM Press.
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, April 1986.
J.R. Burch, E.M. Clarke, D.E. Long, K.L. MacMillan, and D.L. Dill. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 13(4):401–424, April 1994.
J.R. Burch, E.M. Clarke, K.L. McMillan, and D.L. Dill. Sequential Circuit Verification Using Symbolic Model Checking. In Proceedings of the 27th ACM/IEEE Design Automation Conference, pages 46–51, Los Alamitos, CA, June 1990. ACM/IEEE, IEEE Society Press.
W. Lee, A. Pardo, J.-Y. Jang, G. Hachtel, and F. Somenzi. Tearing based automatic abstraction for CTL model checking. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, pages 76–81, Washington, November10-14 1996. IEEE Computer Society Press.
Jørn Lind-Nielsen. BuDDy-A Binary Decision Diagram Package. Technical University of Denmark, 1997. http://britta.it.dtu.dk/~jl/buddy.
Jørn Lind-Nielsen, Henrik Reif Andersen, Gerd Behrmann, Henrik Hulgaard, Kåare Kristoffersen, and Kim G. Larsen. Verification of Large State/Event Systems using Compositionality and Dependency Analysis. In TACAS’98 Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, 1998.
David E. Long. Model Checking, Abstraction and Compositional Verification. PhD thesis, Carnegie Mellon, 1993.
Beologic® A/S. visualSTATE− 3.0 User’s Guide, 1996.
Abelardo Pardo and Gary D. Hachtel. Automatic abstraction techniques for propositional-calculus model checking. In Computer Aided Verification, CAV’97. Springer Verlag, 1997.
Fabio Somenzi. CUDD: CU Decision Diagram Package. University of Colorado at Boulder, 1997.
A. Tarski. A lattice-theoretical fixpoint theorem and its application. Pacific J.Math., 5:285–309, 1955.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lind-Nielsen, J., Andersen, H.R. (1999). Stepwise CTL Model Checking of State/Event Systems. In: Halbwachs, N., Peled, D. (eds) Computer Aided Verification. CAV 1999. Lecture Notes in Computer Science, vol 1633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48683-6_28
Download citation
DOI: https://doi.org/10.1007/3-540-48683-6_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66202-0
Online ISBN: 978-3-540-48683-1
eBook Packages: Springer Book Archive