QBF-Based Symbolic Model Checking for Knowledge and Time
暂无分享,去创建一个
[1] Moshe Y. Vardi. Branching vs. Linear Time: Final Showdown , 2001, TACAS.
[2] Wolfgang Lenski,et al. Logic versus Approximation , 2004, Lecture Notes in Computer Science.
[3] Wojciech Penczek,et al. Bounded model checking for knowledge and real time , 2005, AAMAS '05.
[4] Wojciech Penczek,et al. Verifying epistemic properties of multi-agent systems via bounded model checking , 2002, AAMAS '03.
[5] Ronald Fagin,et al. Reasoning about knowledge , 1995 .
[6] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.
[7] Gerard J. Holzmann,et al. Design and validation of computer protocols , 1991 .
[8] Wojciech Penczek,et al. Bounded Model Checking for Deontic Interpreted Systems , 2005, LCMAS.
[9] Abdul Sattar,et al. Bounded model checking knowledge and branching time in synchronous multi-agent systems , 2005, AAMAS '05.
[10] Moshe Y. Vardi. Implementing Knowledge-Based Programs , 1996, TARK.
[11] Gerard J. Holzmann,et al. The Model Checker SPIN , 1997, IEEE Trans. Software Eng..
[12] Edmund M. Clarke,et al. Model Checking , 1999, Handbook of Automated Reasoning.
[13] Hans Kleine Büning,et al. On Boolean Models for Quantified Boolean Horn Formulas , 2003, SAT.
[14] Hans Kleine Büning,et al. On Models for Quantified Boolean Formulas , 2004, Logic versus Approximation.
[15] Armin Biere,et al. Symbolic Model Checking without BDDs , 1999, TACAS.
[16] Wojciech Penczek,et al. Bounded Model Checking for knowledge over real time , 2004 .
[17] Joseph Y. Halpern,et al. Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.
[18] Gerard J. Holzmann,et al. The SPIN Model Checker , 2003 .
[19] Kenneth L. McMillan,et al. Symbolic model checking , 1992 .