A Framework for Model Checking Against CTLK Using Quantified Boolean Formulas
暂无分享,去创建一个
[1] Nachum Dershowitz,et al. Bounded Model Checking with QBF , 2005, SAT.
[2] Armin Biere,et al. Symbolic Model Checking without BDDs , 1999, TACAS.
[3] Zhenyu Chen,et al. QBF-Based Symbolic Model Checking for Knowledge and Time , 2007, TAMC.
[4] Salil S. Kanhere,et al. Multi-Agent Systems: A Survey , 2018, IEEE Access.
[5] Alessio Lomuscio,et al. The Complexity of Model Checking Concurrent Programs Against CTLK Specifications , 2006, DALT.
[6] Thomas A. Henzinger,et al. Handbook of Model Checking , 2018, Springer International Publishing.
[7] Ronald Fagin,et al. Reasoning about knowledge , 1995 .
[8] Leander Tentrup. Non-prenex QBF Solving Using Abstraction , 2016, SAT.
[9] Alessio Lomuscio,et al. MCMAS: A Model Checker for the Verification of Multi-Agent Systems , 2009, CAV.
[10] Martina Seidl,et al. Non-CNF QBF Solving with QCIR , 2016, AAAI Workshop: Beyond NP.
[11] Michael Wooldridge,et al. Tractable multiagent planning for epistemic goals , 2002, AAMAS '02.
[12] Christel Baier,et al. Principles of model checking , 2008 .