Ron Van Der Meyden
Abstract
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.
- S. Akshay, T. Antonopoulos, J. Ouaknine, and J. Worrell. 2015. Reachability problems for Markov chains. Inform. Process. Lett. 115, 2 (2015), 155--158.Google Scholar
Digital Library
- R. Alur, C. Courcoubetis, and D. L. Dill. 1990. Model-checking for real-time systems. In Proc. of the Symposium on Logic in Computer Science (LICS). 414--425.Google Scholar
- D. Beauquier, A. M. Rabinovich, and A. Slissenko. 2006. A logic of probability with decidable model checking. J. Logic and Computation 16, 4 (2006), 461--487.Google ScholarDigital Library
- J. R. Büchi. 1960. Weak second order arithmetic and finite automata. Zeitscrift für Mathematische Logic und Grundlagen der Mathematik 6 (1960), 66--92.Google ScholarCross Ref
- J. Cassaigne, V. Halava, T. Harju, and F. Nicolas. 2014. Tighter undecidability bounds for matrix mortality, zero-in-the-corner problems, and more. arXiv abs/1404.0644 (2014).Google Scholar
- E. M. Clarke and E. A. Emerson. 1981. The design and synthesis of synchronization skeletons using temporal logic. In Proc. of the Workshop on Logics of Programs, IBM Watson Research Center, LNCS 131. 52--71.Google ScholarCross Ref
- E. M. Clarke, E. A. Emerson, and A. P. Sistla. 1986. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. on Programming Languages and Systems 8, 2 (1986), 244--263.Google ScholarDigital Library
- A. Condon and R. J. Lipton. 1989. On the complexity of space bounded interactive proofs. In Proc. of the IEEE Symp. on Foundations of Computer Science (FOCS). 462--467. 1989Google Scholar
- D.J.N. Eijck. 2004. Dynamic epistemic modelling. CWI. Software Engineering SENE 0424 (2004), 1--112.Google Scholar
- K. Engelhardt, P. Gammie, and R. van der Meyden. 2007. Model checking knowledge and linear time: PSPACE cases. In Proc. of the Int. Symp. on Logical Foundations of Computer Science (LFCS). 195--211.Google Scholar
- G. Everest, I. Shparlinski, A. J. van der Poorten, and T. Ward. 2003. Recurrence Sequences. Amer. Math. Soc., Providence, RI.Google Scholar
- R. Fagin and J. Y. Halpern. 1994. Reasoning about knowledge and probability. J. ACM 41, 2 (1994), 340--367.Google ScholarDigital Library
- R. Fagin, J. Y. Halpern, and N. Megiddo. 1990. A logic for reasoning about probabilities. Information and Computation 87, 1/2 (1990), 78--128.Google ScholarDigital Library
- P. Gammie and R. van der Meyden. 2004. MCK: Model checking the logic of knowledge. In Proc. Conf. on Computer-Aided Verification (CAV). 479--483.Google Scholar
- V. Halava. 1997. Decidable and Undecidable Problems in Matrix Theory. Technical Report 127. Turku Centre for Computer Science, University of Turku, Finland.Google Scholar
- V. Halava, T. Harju, M. Hirvensalo, and J. Karhumäki. 2005. Skolem’s Problem—On the Border between Decidability and Undecidability. Technical Report 683. Turku Centre for Computer Science, University of Turku, Finland.Google Scholar
- J. Y. Halpern. 2003. Reasoning About Uncertainty. MIT Press, Cambridge, MA.Google ScholarDigital Library
- J. Y. Halpern and M. R. Tuttle. 1993. Knowledge, probability, and adversaries. J. ACM 40 (September 1993), 917--960. Issue 4. DOI:https://doi.org/10.1145/153724.153770Google Scholar
- J. Y. Halpern and M. Y. Vardi. 1991. Model checking vs. theorem proving: A manifesto. In Proc. of the Int. Conf. on Principles of Knowledge Representation and Reasoning. 325--334.Google Scholar
- M. Hirvensalo. 2006. Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages. Technical Report 769. Turku Centre for Computer Science, University of Turku, Finland.Google Scholar
- X. Huang, C. Luo, and R. van der Meyden. 2011. Symbolic model checking of probabilistic knowledge. In Proc. of the Conf. on Theoretical Aspects of Rationality and Knowledge (TARK). 177--186.Google Scholar
- X. Huang and R. van der Meyden. 2010. The complexity of epistemic model checking: Clock semantics and branching time. In European Conf. on Artificial Intelligence (ECAI). 549--554.Google Scholar
- X. Huang, K. Su, and C. Zhang. 2012. Probabilistic alternating-time temporal logic of incomplete information and synchronous perfect recall. In Proc. AAAI Conf. on Artificial Intelligence. 765--771.Google Scholar
- M. Kacprzak, W. Nabiałek, A. Niewiadomski, W. Penczek, A. Półrola, M. Szreter, B. Woźna, and A. Zbrzezny. 2008. VerICS 2007 - A model checker for knowledge and real-time. Fundamenta Informaticae 85, 1 (2008), 313--328.Google ScholarDigital Library
- H. W. Kamp. 1968. Tense Logic and the Theory of Linear Order. Ph.D. Dissertation. University of California, Los Angeles.Google Scholar
- M. Loève. 1977. Probability Theory I. Springer-Verlag, New York.Google Scholar
- A. Lomuscio, H. Qu, and F. Raimondi. 2009. MCMAS: A model checker for the verification of multi-agent systems. In Proc. Conf. on Computer-Aided Verification (CAV). 682--688.Google Scholar
- O. Maler, D. Nickovic, and A. Pnueli. 2008. Checking temporal properties of discrete, timed and continuous behaviors. In Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. 475--505.Google Scholar
- Y. V. Matiyasevich. 1993. Hilbert’s Tenth Problem. MIT Press, Cambridge, MA.Google Scholar
- R. van der Meyden and N. V. Shilov. 1999. Model checking knowledge and time in systems with perfect recall. In Proc. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 432--445.Google Scholar
- R. van der Meyden and K.-S. Wong. 2003. Complete axiomatizations for reasoning about knowledge and branching time. Studia Logica 75, 1 (2003), 93--123.Google ScholarCross Ref
- J. Ouaknine and J. Worrell. 2014. Positivity problems for low-order linear recurrence sequences. In Proc. ACM-SIAM Symp. on Discrete Algorithms. 366--379.Google Scholar
- A. Paz. 1971. Introduction to Probabilistic Automata. Academic Press, Orlando, FL.Google ScholarDigital Library
- J. Rutten, M. Kwiatkowska, G. Norman, and D. Parker. 2004. Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems. CRM Monograph Series, Vol. 23. American Mathematical Society, Providence, RI.Google Scholar
- C. Shannon. 1949. Communication theory of secrecy systems. Bell System Technical Journal 28, 4 (1949), 656--715.Google ScholarCross Ref
- T. Skolem. 1934. Ein Verfahren zur Behandlung Gewisser Exponentialer Gleichungen und Diophatischer Gleighungen. In Comptes Rendus du Congrès des Mathématiciens Scandinaves.Google Scholar
- A. Tarski. 1951. A Decision Method for Elementary Algebra and Geometry (2nd ed.). Univ. of California Press, Berkeley and Los Angeles.Google Scholar
- R. Tijdeman, M. Mignotte, and T.N. Shorey. 1984. The distance between terms of an algebraic recurrence sequence. Journal für die Reine und Angewandte Mathematik 349 (1984), 63--76.Google Scholar
Index Terms
- Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
Recommendations
Model checking propositional projection temporal logic based on SPIN
ICFEM'07: Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineeringThis paper investigates a model checking algorithm for Propositional Projection Temporal Logic (PPTL) with finite models. To this end, a PPTL formula is transformed to a Normal Form Graph (NFG), and then a Nondeterministic Finite Automaton (NFA). The ...
A Logic of Probability with Decidable Model Checking* Partially supported by French-Israeli Arc-en-ciel/Keshet project No. 30 and No. 15.
A predicate logic of probability, close to the logics of probability of Halpern et al., is introduced. Our main result concerns the following model-checking problem: deciding whether a given formula holds on the structure defined by a given finite ...
Interval vs. Point Temporal Logic Model Checking: An Expressiveness Comparison
In recent years, model checking with interval temporal logics is emerging as a viable alternative to model checking with standard point-based temporal logics, such as LTL, CTL, CTL*, and the like. The behavior of the system is modeled by means of (...
Comments