SAT-based Bounded Model Checking for Weighted Deontic Interpreted Systems

In this paper we present a SAT-based Bounded Model Check- ing (BMC) method for weighted deontic interpreted systems (i.e., Kripke structures where transitions carry a weight, which is an arbitrary nat- ural number) and properties expressed in the existential fragment of a weighted temporal logic augmented to include knowledge and deontic components (Wectlkd). In particular, since in BMC both the system model and the checked property are translated into a Boolean formula to be analysed by a SAT-solver, we introduce a new Boolean encoding of the Wectlkd formulae that is particularly optimized for managing quantitative weighted temporal operators, knowledge operators, and de- ontic operators, which are typically found in properties of complex multi- agent systems in models of which we assume the possibility that agents may not behave as they are supposed to, and that acting (coordination, negotiation, cooperation, etc.) of agents may cost. We illustrate how the weighted deontic interpreted systems can be applied to the analysis of a variant of the standard bit transmission problem in which an agent may fail to do something it is supposed to do.

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

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

[3]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[4]  Paola Spoletini,et al.  Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers , 2008, ICTAC.

[5]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

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

[7]  Wojciech Penczek,et al.  BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance , 2013, Autonomous Agents and Multi-Agent Systems.

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

[9]  Matteo Pradella,et al.  The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties , 2007, ESEC-FSE '07.

[10]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[11]  Andrzej Zbrzezny,et al.  SAT-Based Bounded Model Checking for Weighted Interpreted Systems and Weighted Linear Temporal Logic , 2013, PRIMA.

[12]  Alessio Lomuscio,et al.  A formalisation of violation, error recovery, and enforcement in the bit transmission problem , 2004, Journal of Applied Logic.

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

[14]  Michael Wooldridge,et al.  Introduction to Multi-Agent Systems , 2016 .

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

[16]  Loïg Jezequel,et al.  Distributed optimal planning: an approach by weighted automata calculus , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[17]  Alessio Lomuscio,et al.  Deontic Interpreted Systems , 2003, Stud Logica.

[18]  Wojciech Penczek,et al.  Bounded Model Checking for the Universal Fragment of CTL , 2002, Fundam. Informaticae.

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

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

[21]  Matteo Pradella,et al.  A Metric Encoding for Bounded Model Checking , 2009, FM.

[22]  Andrzej Zbrzezny,et al.  SAT-Based Bounded Model Checking for RTECTL and Simply-Timed Systems , 2013, EPEW.

[23]  Bożena Woźna-Szcześniak,et al.  SAT-Based Bounded Model Checking for Weighted Deontic Interpreted Systems , 2013, EPIA 2013.

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

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

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

[27]  Hector J. Levesque,et al.  A Logic of Implicit and Explicit Belief , 1984, AAAI.

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

[29]  Andrzej Zbrzezny,et al.  Bounded Model Checking for Weighted Interpreted Systems and for Flat Weighted Epistemic Computation Tree Logic , 2014, PRIMA.