Parallel Model Checking for Temporal Epistemic Logic

Authors:
Marta Kwiatkowska;Alessio Lomuscio;Hongyang Qu
Affiliations:
Oxford University Computing Laboratory, UK, {Marta.Kwiatkowska,Hongyang.Qu}@comlab.ox.ac.uk;Department of Computing, Imperial College London, UK, A.Lomuscio@imperial.ac.uk;Oxford University Computing Laboratory, UK, {Marta.Kwiatkowska,Hongyang.Qu}@comlab.ox.ac.uk
Venue:
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Year:
2010

Citing 14
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Reasoning about knowledge

Reasoning about knowledge
Model checking

Model checking
Using encryption for authentication in large networks of computers

Communications of the ACM
Distributed Processes and the Logic of Knowledge

Proceedings of the Conference on Logic of Programs
Verifying epistemic properties of multi-agent systems via bounded model checking

Fundamenta Informaticae - Concurrency specification and programming
Distributed Symbolic Model Checking for μ-Calculus

Formal Methods in System Design
Towards verifying compliance in agent-based web service compositions

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Abstraction in model checking multi-agent systems

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
MCMAS: A Model Checker for the Verification of Multi-Agent Systems

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A symmetry reduction technique for model checking temporal-epistemic logic

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A new reachability algorithm for symmetric multi-processor architecture

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
MCMAS: a model checker for multi-agent systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Symbolic model checking for temporal-epistemic logic

Logic Programs, Norms and Action
Exponential acceleration of model checking for perfect recall systems

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Exponential improvement of time complexity of model checking for multiagent systems with perfect recall

Programming and Computing Software
A cutoff technique for the verification of parameterised interpreted systems with parameterised environments

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of the verification of multi-agent systems by means of parallel algorithms. We present algorithms for CTLK, a logic combining branching time temporal logic with epistemic modalities. We report on an implementation of these algorithms and present the experimental results obtained. The results point to a significant speed-up in the verification step.