Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata

Authors:
Francesco Belardinelli;Andrew V. Jones;Alessio Lomuscio
Affiliations:
(Correspd.) Imperial College London, Exhibition Road, London SW7 2AZ, UK. {f.belardinelli,andrew.jones,a.lomuscio}@imperial.ac.uk;Imperial College London, Exhibition Road, London SW7 2AZ, UK. {f.belardinelli,andrew.jones,a.lomuscio}@imperial.ac.uk;Imperial College London, Exhibition Road, London SW7 2AZ, UK. {f.belardinelli,andrew.jones,a.lomuscio}@imperial.ac.uk
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2011

Citing 16
Cited 0

Alternating automata, the weak monadic theory of the tree, and its complexity

International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Alternating automata on infinite trees

Theoretical Computer Science
Reasoning about knowledge

Reasoning about knowledge
Model checking

Model checking
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Tractable multiagent planning for epistemic goals

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Epistemic Logic for AI and Computer Science

Epistemic Logic for AI and Computer Science
NUSMV: A New Symbolic Model Verifier

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Gossip-based peer sampling

ACM Transactions on Computer Systems (TOCS)
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual
MCMAS: A Model Checker for the Verification of Multi-Agent Systems

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis

Electronic Notes in Theoretical Computer Science (ENTCS)
Partial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Distributed BDD-based BMC for the verification of multi-agent systems

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Improved bounded model checking for a fair branching-time temporal epistemic logic

MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
The complexity of model checking concurrent programs against CTLK specifications

DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.