Symbolic model checking for temporal-epistemic logics

Abstract

Abstract. We survey some of the recent work in verification via symbolic model checking of temporal-epistemic logic. Specifically, we discuss OBDD-based and SAT-based approaches for epistemic logic built on discrete and real-time branching time temporal logic. The underlying semantical model considered throughout is the one of interpreted system, suitably extended whenever necessary.

Model Checking Epistemic and Probabilistic Properties of Multi-agent Systems

“…The epistemic operator K i is a S5 modality [10], which means knowledge is reflexive and Euclidean [12]. K i φ represents "agent i knows that φ".…”

“…The validity of case a through c is straightforward. The proof of cases d and e can be found in [10] and [1]. We only prove the case f .…”

“…The algorithm for the calculation of the set of states Sat CT LK (φ) can be found in [10]. For P CT L, to determine if s ∈ Sat P CT L (φ), where φ = P r b ψ, we need to compute the probability P rob(s |= ψ) for the event specified by ψ.…”

“…In such systems, reasoning with uncertainty is an important feature. Model checking, a well-designed formal technique for verifying if models satisfy specific properties, is widely used to verify the epistemic properties of these systems [9,10,13]. In the past two years, researchers in [3,4,7] have proposed methods to model and check multi-agent systems using Markov chains, which are stochastic processes behaving as transition systems extended by probabilistic choices among successor states.…”

A quantitative doxastic logic for probabilistic processes and applications to information-hiding

“…In (Lomuscio et al, 2007), the authors present a formalization of non-probabilistic anonymity for the dining cryptographers expressed in a modal logic combining knowledge and time. Hence, their notion of knowledge is dynamic, yet not inflected with probability: it really is knowledge, which necessarily is true, and not belief, which possibly is false.…”