A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Completeness and Complexity of Bounded Model Checking
[chapter]
2004
Lecture Notes in Computer Science
For every finite model M and an LTL property ϕ, there exists a number CT (the Completeness Threshold ) such that if there is no counterexample to ϕ in M of length CT or less, then M |= ϕ. Finding this number, if it is sufficiently small, offers a practical method for making Bounded Model Checking complete. We describe how to compute an over-approximation to CT for a general LTL property using Büchi automata, following the Vardi-Wolper LTL model checking framework. Based on the value of CT , we
doi:10.1007/978-3-540-24622-0_9
fatcat:msh4kjgil5gcves3jyu2osfsvm