Verifying multi-agent systems via unbounded model checking

Authors:
M. Kacprzak;A. Lomuscio;T. Łasica;W. Penczek;M. Szreter
Affiliations:
Institute of Mathematics and Physics, Białystok University of Technology, Białystok, Poland;Department of Computer Science, King's College London, London, United Kingdom;Institute of Computer Science, PAS, Warsaw, Poland;,Institute of Computer Science, PAS, Warsaw, Poland;Institute of Computer Science, PAS, Warsaw, Poland
Venue:
FAABS'04 Proceedings of the Third international conference on Formal Approaches to Agent-Based Systems
Year:
2004

Citing 18
Cited 6

Model checking vs. theorem proving: a manifesto

Artificial intelligence and mathematical theory of computation
Reasoning about knowledge

Reasoning about knowledge
Model checking

Model checking
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Modal logic

Modal logic
Model checking multi-agent systems with MABLE

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Tractable multiagent planning for epistemic goals

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Introduction to Multiagent Systems

Introduction to Multiagent Systems
Model Checking Knowledge and Time

Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Characterizing Correctness Properties of Parallel Programs Using Fixpoints

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Applying SAT Methods in Unbounded Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Computationally Grounded Theories of Agency

ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Verifying epistemic properties of multi-agent systems via bounded model checking

Fundamenta Informaticae - Concurrency specification and programming
Verification of Multiagent Systems via Ordered Binary Decision Diagrams: An Algorithm and Its Implementation

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
√erics: a tool for verifying timed automata and estelle specifications

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1

Autonomous Agents and Multi-Agent Systems
VerICS 2007 - a Model Checker for Knowledge and Real-Time

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
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
SAT-Based bounded model checking for deontic interleaved interpreted systems

KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Specification and verification of multi-agent systems

ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
VerICS 2007 - a Model Checker for Knowledge and Real-Time

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present an approach to the problem of verification of epistemic properties in multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend the technique of unbounded model checking from a purely temporal setting to a temporal-epistemic one. In order to achieve this, we base our discussion on interpreted systems semantics, a popular semantics used in multi-agent systems literature. We give details of the technique and show how it can be applied to the well known train, gate and controller problem.