A new Epistemic Strategy Logic internalizes uniformity and other strategy properties in the object language, and its perfect-information core BSL is shown equiexpressive with Strategy Logic.
Model Checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We identify a subproblem of the model-checking problem for the epistemic \mu-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.
fields
cs.LO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Dealing with imperfect information in Strategy Logic
A new Epistemic Strategy Logic internalizes uniformity and other strategy properties in the object language, and its perfect-information core BSL is shown equiexpressive with Strategy Logic.