Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata

We introduce a novel automata-theoretic approach for the verification of multi-agent systems. We present epistemic alternating tree automata, an extension of alternating tree automata, and use them to represent specifications in the temporal-epistemic logic CTLK. We show that model checking a memory-less interpreted system against a CTLK property can be reduced to checking the language non-emptiness of the composition of two epistemic tree automata. We report on an experimental implementation and discuss preliminary results. We evaluate the effectiveness of the technique using two real-life scenarios: a gossip protocol and the train gate controller.

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

[2]  Alessio Lomuscio,et al.  MCMAS: A Model Checker for the Verification of Multi-Agent Systems , 2009, CAV.

[3]  W. van der Hoek,et al.  Epistemic logic for AI and computer science , 1995, Cambridge tracts in theoretical computer science.

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

[5]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.

[6]  David E. Muller,et al.  Alternating Automata on Infinite Trees , 1987, Theor. Comput. Sci..

[7]  Michael Wooldridge,et al.  Tractable multiagent planning for epistemic goals , 2002, AAMAS '02.

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

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

[10]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[11]  Alessio Lomuscio,et al.  The complexity of model checking concurrent programs against CTLK specifications , 2006, AAMAS '06.

[12]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

[13]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[14]  E. Muller David,et al.  Alternating automata on infinite trees , 1987 .

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

[16]  Frank Wolter,et al.  Handbook of Modal Logic , 2007, Studies in logic and practical reasoning.

[17]  Fausto Giunchiglia,et al.  NUSMV: A New Symbolic Model Verifier , 1999, CAV.

[18]  David E. Muller,et al.  Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity , 1986, ICALP.

[19]  Albert Nymeyer,et al.  Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis , 2006, MoChArt@CONCUR/SPIN.

[20]  Alessio Lomuscio,et al.  Model Checking Temporal-Epistemic Logic Using Tree Automata , 2010 .

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