QBF-based symbolic model checking for knowledge and time

Authors:
Conghua Zhou;Zhenyu Chen;Zhihong Tao
Affiliations:
School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang, Jiangsu, China;School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu, China;School of Software and Microelectronics, Peking University, Beijing, China
Venue:
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Year:
2007

Citing 11
Cited 1

Design and validation of computer protocols

Design and validation of computer protocols
Model checking vs. theorem proving: a manifesto

Artificial intelligence and mathematical theory of computation
Reasoning about knowledge

Reasoning about knowledge
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Symbolic Model Checking

Symbolic Model Checking
Branching vs. Linear Time: Final Showdown

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying epistemic properties of multi-agent systems via bounded model checking

Fundamenta Informaticae - Concurrency specification and programming
Implementing knowledge-based programs

TARK '96 Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge
Bounded model checking for knowledge and real time

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Bounded model checking knowledge and branching time in synchronous multi-agent systems

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Bounded Model Checking for Deontic Interpreted Systems

Electronic Notes in Theoretical Computer Science (ENTCS)

Symbolic algorithmic verification of generalized noninterference

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

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.