Optimizing Epistemic Model Checking Using Conditional Independence (Extended Abstract)

  title={Optimizing Epistemic Model Checking Using Conditional Independence (Extended Abstract)},
  author={Ron van der Meyden},
This paper shows that conditional independence reasoning can be applied to optimize epistemic model checking, in which one verifies that a model for a number of agents operating with imperfect information satisfies a formula expressed in a modal multi-agent logic of knowledge. The optimization has been implemented in the epistemic model checker MCK. The paper reports experimental results demonstrating that it can yield multiple orders of magnitude performance improvements. 
1 Citations

Figures and Tables from this paper

Strategic logics for collaborative embedded systems
The results show that strategic model checking is useful to investigate certain aspects of CSGs, such as the impact of environmental changes, but also show some limitations of the approach, when it comes to the analysis of implementation-level aspects,such as performance.


Model Checking for Reasoning about Incomplete Information Games
This paper presents a systematic translation of GDL-II to a model checking language, proves the translation to be correct, and demonstrates the feasibility of applying model checking tools for G DL-II games by four case studies.
MCK: Model Checking the Logic of Knowledge
The system MCK introduced in this paper implements parts of the logic of knowledge and its combinations with temporal logic theory, and implements part of this theory in the specification formalism.
Epistemic Model Checking for Knowledge-Based Program Implementation: An Application to Anonymous Broadcast
This paper describes how epistemic model checking technology may be applied to discover and verify concrete implementations based on this abstract level of description of protocols in which agent actions are related to their states of knowledge.
Model Checking Knowledge and Linear Time: PSPACE Cases
A general algorithm scheme based on bisimulations to a class of structures that capture the way that agents update their knowledge is presented, which leads to PSPACE implementations of model checking the logic of knowledge and linear time in several special cases.
Symbolic model checking the knowledge of the dining cryptographers
This paper describes the application of symbolic techniques (in particular, OBDDs) to model checking specifications in the logic of knowledge for an agent operating with synchronous perfect recall in
Embedding Logics in the Local Computation Framework
This paper shows how the Local Computation Framework can be used for the computation of logical deduction in two different ways; the first way involves embedding model structures in the framework; the second, and more direct, way involvesembedding sets of formulae.
Abstraction for epistemic model checking of dining cryptographers-based protocols
It is proved that the abstraction preserves a rich class of specifications in the logic of knowledge that is applied to optimize model checking of implementations of a knowledge-based program that uses the Dining Cryptographers protocol as a primitive in an anonymous broadcast system.
A Logical Notion of Conditional Independence: Properties and Application
Automatic verification of temporal-epistemic properties of cryptographic protocols
A technique for automatically verifying cryptographic protocols specified in the mainstream specification language CAPSL is presented and a compiler that implements this translation is presented, which links to the symbolic model checker MCMAS.
Computation in Valuation Algebras
The main goal of this chapter is to describe an abstract framework called valuation algebra for computing marginals using local computation, useful in many domains, and especially for managing uncertainty in expert systems using probability, Dempster-Shafer belief functions, Spohnian epistemic belief theory, and possibility theory.