TY - GEN
T1 - Model checking an epistemic μ-calculus with synchronous and perfect recall semantics
AU - Bozianu, Rodica
AU - Dima, Cǎtǎlin
AU - Enea, Constantin
N1 - Publisher Copyright:
Copyright 2013 by the authors.
PY - 2013/1/1
Y1 - 2013/1/1
N2 - We identify a subproblem of the model-checking problem for the epistemic μ-calculus which is decidable. Formulas in the instances of this subproblem allow free variables within the scope of epistemic modalities in a restricted form that avoids embodying any form of common knowledge. Our subproblem subsumes known decidable fragments of epistemic CTL/LTL, may express winning strategies in two-player games with one player having imperfect information and non-observable objectives, and, with a suitable encoding, decidable instances of the model-checking problem for ATLiR.
AB - We identify a subproblem of the model-checking problem for the epistemic μ-calculus which is decidable. Formulas in the instances of this subproblem allow free variables within the scope of epistemic modalities in a restricted form that avoids embodying any form of common knowledge. Our subproblem subsumes known decidable fragments of epistemic CTL/LTL, may express winning strategies in two-player games with one player having imperfect information and non-observable objectives, and, with a suitable encoding, decidable instances of the model-checking problem for ATLiR.
M3 - Conference contribution
AN - SCOPUS:85087097086
T3 - Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2013
SP - 176
EP - 185
BT - Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2013
A2 - Schipper, Burkhard C.
PB - Institute of Mathematical Sciences
T2 - 14th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2013
Y2 - 7 January 2013 through 9 January 2013
ER -