From Bounded to Unbounded Model Checking for Temporal Epistemic Logic

Authors:
M. Kacprzak;A. Lomuscio;W. Penczek
Affiliations:
Białystok University of Technology, Institute of Mathematics and Physics, 15-351 Białystok, ul. Wiejska 45A, Poland;Department of Computer Science, King's College London, London WC2R 2LS, United Kingdom;Institute of Computer Science, PAS, 01-237 Warsaw, ul. Ordona 21, Poland and Podlasie Academy, Institute of Informatics, Siedlce, Poland
Venue:
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Year:
2004

Citing 14
Cited 11

The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Reasoning about knowledge

Reasoning about knowledge
Model checking

Model checking
A machine program for theorem-proving

Communications of the ACM
Bounded Model Checking Using Satisfiability Solving

Formal Methods in System Design
Symbolic Model Checking

Symbolic Model Checking
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
Bounded model checking for the universal fragment of CTL

Fundamenta Informaticae
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
Applying SAT Methods in Unbounded Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Model checking agentspeak

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Verifying epistemic properties of multi-agent systems via bounded model checking

Fundamenta Informaticae - Concurrency specification and programming

Model checking for multivalued logic of knowledge and time

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Complexity Issues in Multiagent Logics

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Symbolic model checking for temporal-epistemic logics

ACM SIGACT News
VerICS 2007 - a Model Checker for Knowledge and Real-Time

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
SAT-based Unbounded Model Checking of Timed Automata

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Towards Verification of Java Programs in perICS

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic

Model Checking and Artificial Intelligence
Verification of multi-agent systems via bounded model checking

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in 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
Symbolic model checking for temporal-epistemic logic

Logic Programs, Norms and Action
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the problem of verification of temporal epistemic properties of multi-agent systems by means of symbolic model checking. An overview of the technique of bounded model checking for temporal epistemic logic, and an analysis of some limitations of the method are provided. An extension of this technique called unbounded model checking to solve these limitations is explored. Similarities and differences of the two methods are explicitly exemplified by the analysis of a scenario in the two formalisms.