On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
The complexity of probabilistic verification
Journal of the ACM (JACM)
Constructing automata from temporal logic formulas: a tutorial
Lectures on formal methods and performance analysis
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
First-order logic with two variables and unary temporal logic
Information and Computation - Special issue: LICS'97
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
The complexity of propositional linear temporal logics
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Checking LTL Properties of Recursive Markov Chains
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On the complexity of LTL model-checking of recursive state machines
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
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 nondeterministic 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.