Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic

• Published in: ACM transactions on computational logic Vol. 21; no. 4; pp. 1 - 26
• Main Authors: Meyden, Ron Van Der, Patra, Manas K.
• Format: Journal Article
• Language: English
• Published: 01.10.2020
• ISSN: 1529-3785; 1557-945X
• DOI: 10.1145/3409250

We investigate the decidability of model checking logics of time, knowledge, and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observable discrete-time Markov chains. Decidability results are known for certain restricted logics with respect to these semantics, subject to a variety of restrictions that are either unexplained or involve a longstanding unsolved mathematical problem. We show that mild generalizations of the known decidable cases suffice to render the model checking problem definitively undecidable. In particular, for the synchronous perfect recall semantics, a generalization from temporal operators with finite reach to operators with infinite reach renders model checking undecidable. The case of the clock semantics is closely related to a monadic second-order logic of time and probability that is known to be decidable, except on a set of measure zero. We show that two distinct extensions of this logic make model checking undecidable. One of these involves polynomial combinations of probability terms, the other involves monadic second-order quantification into the scope of probability operators. These results explain some of the restrictions in previous work.