Two Variable vs. Linear Temporal Logic in Model Checking and Games
Verification tasks have non-elementary complexity for properties of linear traces specified in first-order logic, and thus various limited logical languages are employed. In this paper we consider two restricted specification logics, linear temporal logic (LTL) and two-variable first-order logic (FO2). LTL is more expressive, but FO2 is often more succinct, and hence it is not clear which should be easier to verify. In this paper we take a comprehensive look at the issue, giving a comparison of verification problems for FO2, LTL, and the subset of LTL expressively equivalent to FO2, unary temporal logic (UTL). We give two logic-to-automata translations which can be used to give upper bounds for FO2 and UTL; we apply these to get new bounds for both non-deterministic systems (hierarchical and recursive state machines, games) and for probabilistic systems (Markov chains, recursive Markov chains, and Markov decision processes). We couple this with lower-bound arguments for FO2 and UTL. Our results give both a unified approach to understanding the behavior of FO2 and UTL, along with a nearly comprehensive picture of the complexity of verification for these logics.
KeywordsMarkov Chain Model Check Temporal Logic Markov Decision Process Linear Temporal Logic
Unable to display preview. Download preview PDF.
- [BFT98]Buhrman, H., Fortnow, L., Thierauf, T.: Nonrelativizing separations. In: COCO (1998)Google Scholar
- [CH11]Chatterjee, K., Henzinger, T.A.: A survey of stochastic ω-regular games. J. Comput. Syst. Sci (2011)Google Scholar
- [CSS03]Couvreur, J.-M., Saheb, N., Sutre, G.: An optimal automata approach to LTL model checking of probabilistic systems. In: Logic for Programming, A.I., and Reasoning, pp. 361–375 (2003)Google Scholar
- [Eme90]Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics, pp. 995–1072. Elsevier, Amsterdam (1990)Google Scholar
- [Kam68]Kamp, H.W.: Tense Logic and the Theory of Linear Order. PhD thesis, UCLA (1968)Google Scholar
- [PR89]Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179–190 (1989)Google Scholar
- [SC82]Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. In: STOC, pp. 159–168 (1982)Google Scholar
- [Sto74]Larry, J.: Stockmeyer. The Complexity of Decision Problems in Automata Theory and Logic. PhD thesis, MIT, Cambridge, Massasuchets, USA (1974)Google Scholar
- [WI09]Weis, P., Immerman, N.: Structure theorem and strict alternation hierarchy for FO2 on words. In: LMCS, vol. 5(3) (2009)Google Scholar
- [Yan10]Yannakakis, M.: Personal communication (2010)Google Scholar
- [YE05]Yannakakis, M., Etessami, K.: Checking LTL properties of Recursive Markov Chains. In: QEST, pp. 155–165 (2005)Google Scholar