Abstract
For temporal and epistemic property CTLK we propose a new symbolic model checking technique based on Quantified Boolean Formula(QBF). The verification approach is based on an adaption of the technique of bounded model checking. We decide the validity of a CTLK formula ψ in the finite reachable state space of a system, and reduce the validity to a QBF which is satisfiable if and only if ψ is validated. The new technique avoids the space blow up of BDDs, and sometimes speeds up the verification.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Clarke, E.M., Grumberg, O., Peled, D.: Model checking. MIT Press, Cambridge (2000)
Holzmann, G.: Design and Validation of Computer Protocols. Prentice Hall International, Hemel Hempstead (1991)
Holzmann, G.: The Spin model checker. IEEE Transaction on Software Engineering 23(5), 279–295 (1997)
Vardi, M.Y.: Branching vs. linear time: Final showdown. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 1–22. Springer, Heidelberg (2001)
McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Boston (1993)
Halpern, J.Y., Vardi, M.Y.: Model checking vs. theorem proving: a manifesto. In: Lifschitz, V. (ed.) Artificial Intelligence and Mathematical Theory of Computation, pp. 151–176. Academic Press, San Diego (1991)
Fagin, R., et al.: Resaoning about Knowledge. MIT Press, Cambridge (1995)
Vardi, M.Y.: Implementing knowledge-based programs. In: Proc. of the Conf. on Theoretical Aspects of Rationality and Knowledge, pp. 15–30 (1996)
Biere, A., et al.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) ETAPS 1999 and TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)
Penczek, W., Lomuscio, A.: Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking. Fundamenta Informaticae 55(2), 167–185 (2003)
Luo, X., et al.: Bounded Model Checking Knowledge and Branching Time in Synchronous Multi-agent Systems. In: AAMAS’05 (2005)
Wozna, B., Lomuscio, A., Penczek, W.: Bounded Model Checking for Knowledge and Real Time. In: AAMAS’05 (2005)
Wozna, B., Lomuscio, A., Penczek, W.: Bounded model checking for deontic interpreted systems. In: Proc. of LCMAS’04. ENTCS, vol. 126, pp. 93–114. Elsevier, Amsterdam (2004)
Zhao, X., Kleine Büning, H.: On Models for Quantified Boolean Formulas. In: Lenski, W. (ed.) Logic versus Approximation. LNCS, vol. 3075, pp. 18–32. Springer, Heidelberg (2004)
Kleine Büning, H., Subramani, K., Zhao, X.: On Boolean Models for Quantified Boolean Horn Formulas. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 93–104. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, C., Chen, Z., Tao, Z. (2007). QBF-Based Symbolic Model Checking for Knowledge and Time. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)