BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance

The paper deals with symbolic approaches to bounded model checking (BMC) for the existential fragment of linear temporal logic extended with the epistemic component (ELTLK), interpreted over interleaved interpreted systems. Two translations of BMC for ELTLK to SAT and to operations on BDDs are presented. The translations have been implemented, tested, and compared with each other as well as with another tool on several benchmarks for MAS. Our experimental results reveal advantages and disadvantages of SAT- versus BDD-based BMC for ELTLK.

[1]  Gianpiero Cabodi,et al.  Can BDDs compete with SAT solvers on bounded model checking? , 2002, DAC '02.

[2]  Andrzej Zbrzezny,et al.  SAT-Based BMC for Deontic Metric Temporal Logic and Deontic Interleaved Interpreted Systems , 2012, DALT.

[3]  Andrzej Zbrzezny,et al.  A New Translation from ECTL* to SAT , 2012, Fundam. Informaticae.

[4]  Armin Biere,et al.  PicoSAT Essentials , 2008, J. Satisf. Boolean Model. Comput..

[5]  Kaile Su,et al.  Symbolic model checking the knowledge of the dining cryptographers , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..

[6]  Wojciech Penczek,et al.  Bounded model checking for knowledge and real time , 2005, AAMAS '05.

[7]  Ron van der Meyden,et al.  MCK: Model Checking the Logic of Knowledge , 2004, CAV.

[8]  Alessio Lomuscio,et al.  Distributed BDD-based BMC for the verification of multi-agent systems , 2010, AAMAS.

[9]  Wojciech Penczek,et al.  Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol , 2006, Fundam. Informaticae.

[10]  Edmund M. Clarke,et al.  Another Look at LTL Model Checking , 1994, Formal Methods Syst. Des..

[11]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[12]  Barbara Messing,et al.  An Introduction to MultiAgent Systems , 2002, Künstliche Intell..

[13]  Michael Wooldridge,et al.  Model Checking Multi-Agent Programs with CASP , 2003, CAV.

[14]  Armando Tacchella,et al.  Benefits of Bounded Model Checking at an Industrial Setting , 2001, CAV.

[15]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[16]  Rafael H. Bordini,et al.  Model checking agent programming languages , 2012, Automated Software Engineering.

[17]  Wojciech Penczek,et al.  Bounded model checking for knowledge and linear time , 2012, AAMAS.

[18]  Artur Meski,et al.  Two Approaches to Bounded Model Checking for a Soft Real-Time Epistemic Computation Tree Logic , 2013, DCAI.

[19]  Cheng Luo,et al.  Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic , 2010, MoChArt.

[20]  Wojciech Penczek,et al.  Specification and Verification of Multi-Agent Systems , 2010, ESSLLI.

[21]  Jürgen Dix,et al.  Model Checking Abilities of Agents: A Closer Look , 2008, Theory of Computing Systems.

[22]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[23]  Michael Wooldridge,et al.  Model Checking and Artificial Intelligence, 5th International Workshop, MoChArt 2008, Patras, Greece, July 21, 2008. Revised Selected and Invited Papers , 2009, MoChArt.

[24]  Parosh Aziz Abdulla,et al.  Symbolic Reachability Analysis Based on SAT-Solvers , 2000, TACAS.

[25]  Michael Wooldridge,et al.  Model Checking Strategic Equilibria , 2009, MoChArt.

[26]  Michael Wooldridge,et al.  Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications , 2003, Stud Logica.

[27]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[28]  Andrzej Zbrzezny,et al.  SAT-Based Bounded Model Checking for Deontic Interleaved Interpreted Systems , 2012, KES-AMSTA.

[29]  Fabio Somenzi,et al.  Efficient Büchi Automata from LTL Formulae , 2000, CAV.

[30]  Wojciech Penczek,et al.  Partial order reduction for model checking interleaved multi-agent systems , 2009 .

[31]  Wojciech Penczek,et al.  Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems , 2012, Fundam. Informaticae.

[32]  Stephan Merz,et al.  Model Checking , 2000 .

[33]  Masahiro Fujita,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, DAC '99.

[34]  Wojciech Penczek,et al.  Two Approaches to Bounded Model Checking for Linear Time Logic with Knowledge , 2012, KES-AMSTA.

[35]  Fabio Somenzi,et al.  CUDD: CU Decision Diagram Package Release 2.2.0 , 1998 .

[36]  Michael Wooldridge,et al.  Property-based Slicing for Agent Verification , 2009, J. Log. Comput..

[37]  Wojciech Penczek,et al.  VerICS 2007 - a Model Checker for Knowledge and Real-Time , 2008, Fundam. Informaticae.

[38]  Wojciech Penczek,et al.  Checking Reachability Properties for Timed Automata via SAT , 2002, Fundam. Informaticae.

[39]  Viktor Schuppan,et al.  Linear Encodings of Bounded LTL Model Checking , 2006, Log. Methods Comput. Sci..

[40]  Doron A. Peled,et al.  All from One, One for All: on Model Checking Using Representatives , 1993, CAV.

[41]  Ron van der Meyden,et al.  Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract) , 1999, FSTTCS.

[42]  Wojciech Jamroga,et al.  Verifying agents with memory is harder than it seemed , 2010, AI Commun..

[43]  Abdul Sattar,et al.  Model Checking Temporal Logics of Knowledge Via OBDDs , 2007, Comput. J..

[44]  Wojciech Penczek,et al.  BDD-based Bounded Model Checking for LTLK over Two Variants of Interpreted Systems ? , 2012 .

[45]  Alessio Lomuscio,et al.  Automatic Verification of Knowledge and Time with NuSMV , 2007, IJCAI.

[46]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[47]  Wojciech Penczek,et al.  Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems , 2010, Fundam. Informaticae.

[48]  Wojciech Penczek,et al.  Bounded Model Checking for Interpreted Systems: Preliminary Experimental Results , 2002, FAABS.

[49]  Andrzej Zbrzezny,et al.  Improving the Translation from ECTL to SAT , 2008, Fundam. Informaticae.

[50]  Joseph Y. Halpern,et al.  Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.

[51]  Alessio Lomuscio,et al.  Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams , 2007, J. Appl. Log..

[52]  Michael Wooldridge,et al.  Introduction to multiagent systems , 2001 .

[53]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[54]  Wojciech Penczek,et al.  Verifying epistemic properties of multi-agent systems via bounded model checking , 2002, AAMAS '03.

[55]  Michael Wooldridge,et al.  Model Checking Knowledge and Time , 2002, SPIN.

[56]  Wojciech Penczek,et al.  Bounded Model Checking for Deontic Interpreted Systems , 2005, LCMAS.

[57]  Andrzej Zbrzezny,et al.  The BMC Method for the Existential Part of RTCTLK and Interleaved Interpreted Systems , 2011, EPIA.

[58]  Wojciech Penczek,et al.  Bounded Model Checking Linear Time and Knowledge Using Decision Diagrams ? , 2011 .