Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking

Authors:
Wojciech Penczek;Alessio Lomuscio
Affiliations:
Institute of Computer Science, PAS, 01-237 Warsaw, ul. Ordona 21, Poland and Podlasie Academy, Institute of Informatics, Siedlce, Poland;Department of Computer Science, King's College London, London WC2R 2LS, UK
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Year:
2003

Citing 21
Cited 8

Knowledge and common knowledge in a distributed environment

Journal of the ACM (JACM)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
What can machines know?: On the properties of knowledge in distributed systems

Journal of the ACM (JACM)
Reasoning about knowledge

Reasoning about knowledge
Deontic logic: a concise overview

Deontic logic in computer science
Model checking

Model checking
Knowledge in multiagent systems: initial configurations and broadcast

ACM Transactions on Computational Logic (TOCL)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Bounded Model Checking Using Satisfiability Solving

Formal Methods in System Design
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
Seeing Is Believing

Journal of Logic, Language and Information
Model Checking Knowledge and Time

Proceedings of the 9th International SPIN Workshop on Model Checking of Software
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
Verifying epistemic properties of multi-agent systems via bounded model checking

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Towards model checking interpreted systems

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Computationally Grounded Theories of Agency

ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Complete Axiomatizations for Reasoning about Knowledge and Time

SIAM Journal on Computing
Bounded Model Checking for the Universal Fragment of CTL

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

LDYIS: a Framework for Model Checking Security Protocols

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A Quantifier-free First-order Knowledge Logic of Authentication

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Verifying conformance of multi-agent commitment-based protocols

Expert Systems with Applications: An International Journal
From Bounded to Unbounded Model Checking for Temporal Epistemic Logic

Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Communicative commitments: Model checking and complexity analysis

Knowledge-Based Systems
Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Combined model checking for temporal, probabilistic, and real-time logics

Theoretical Computer Science
BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be applied to the "attacking generals problem", a typical example of coordination in multi-agent systems.