Bounded Model Checking for Deontic Interpreted Systems

Authors:
Bożena Woźna;Alessio Lomuscio;Wojciech Penczek
Affiliations:
Department of Computer Science, University College London, Gower Street, London WC1E 6BT, United Kingdom;Department of Computer Science, University College London, Gower Street, London WC1E 6BT, United Kingdom;Institute of Computer Science, PAS, Ordona 21, 01-237 Warsaw, Poland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 7
Cited 11

A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols

Journal of the ACM (JACM)
Reasoning about knowledge

Reasoning about knowledge
Model checking

Model checking
Bounded Model Checking Using Satisfiability Solving

Formal Methods in System Design
Introduction to Multiagent Systems

Introduction to Multiagent Systems
Bounded model checking for the universal fragment of CTL

Fundamenta Informaticae
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
Bounded model checking for knowledge and real time

Artificial Intelligence
Symbolic model checking for temporal-epistemic logics

ACM SIGACT News
QBF-based symbolic model checking for knowledge and time

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Towards verifying contract regulated service composition

Autonomous Agents and Multi-Agent Systems
A state/event temporal deontic logic

DEON'06 Proceedings of the 8th international conference on Deontic Logic and Artificial Normative Systems
A complete and decidable axiomatisation for deontic interpreted systems

DEON'06 Proceedings of the 8th international conference on Deontic Logic and Artificial Normative Systems
Symbolic model checking for temporal-epistemic logic

Logic Programs, Norms and Action
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
VerICS 2007 - a Model Checker for Knowledge and Real-Time

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
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.01

Visualization

Abstract

We propose a framework for the verification of multi-agent systems' specification by symbolic model checking. The language CTLKD (an extension of CTL) allows for the representation of the temporal evolution of epistemic states of the agents, as well as their correct and incorrect functioning behaviour. We ground our analysis on the semantics of deontic interpreted systems. The verification approach is based on an adaption of the technique of bounded model checking, a mainstream approach in verification of reactive systems. We test our results on a typical communication scenario: the bit transmission problem with faults.