Two variable and linear temporal logic in model checking and games

  title={Two variable and linear temporal logic in model checking and games},
  author={Rastislav Lenhardt},
  journal={Log. Methods Comput. Sci.},
  • R. Lenhardt
  • Published 19 March 2013
  • Computer Science
  • Log. Methods Comput. Sci.
Model checking linear-time properties expressed in first-order logic has non-elementary complexity, and thus various restricted logical languages are employed. In this paper we consider two such restricted specification logics, linear temporal logic (LTL) and two-variable first-order logic (FO2). LTL is more expressive but FO2 can be more succinct, and hence it is not clear which should be easier to verify. We take a comprehensive look at the issue, giving a comparison of verification problems… 
6 Citations

Figures and Tables from this paper

Are Good-for-Games Automata Good for Probabilistic Model Checking?
It is shown how good-for-games automata can be used for the quantitative analysis of systems modeled by Markov decision processes against ω-regular specifications and evaluated by a series of experiments.
Parametric LTL on Markov Chains
The central problem studied in this paper is to determine the set of parameter valuations V ≚ p (ϕ) for which the probability to satisfy pLTL-formula ϕ in a Markov chain meets a given threshold ≺ p, where ≺ is a comparison on reals and p a probability.
Foreword Organization Organizing Committee Selection Committee Keynote Speaker Conference Program Verification 1 1 Ltl Model Checking on Interval Markov Chains 13 Neighbourhood Watch -network Coding Efficiency Depends on Good Neighbours Martin Strohmeier 15 Multi-channel Key Distribution Protocols U
This year's Departmental Student Conference was an interesting and enjoyable event, and one of the most important aspects of the student conference is its ability to bridge the subject divide within the department.
Markov Chains and Unambiguous Büchi Automata
A polynomially time-bounded algorithm for probabilistic model checking of discrete-time Markov chains against unambiguous Buchi automata specifications is provided and an implementation and experiments are reported on.
Theoretical Computer Science
Strong Bridges and Strong Articulation Points are shown as well as weak bridges and strong articulation points in the second of a two-part series on how human interaction with concrete objects affects their ability to communicate.
Computing Conditional Probabilities in Markovian Models Efficiently ? Extended Version
For Markov decision processes, it is shown that the task to compute maximal reachability probabilities under reachability conditions is solvable in polynomial time, while it was conjectured to be computationally hard.


Two Variable vs. Linear Temporal Logic in Model Checking and Games
This paper gives two logic-to-automata translations which can be used to give upper bounds for FO2 and UTL, and applies these to get new bounds for both nondeterministic systems and probabilistic systems, including Markov chains and Markov decision processes.
Verification of Two-Variable Logic Revisited
A language that subsumes both FO2 and LTL, and inherits the model checking properties of both languages is presented, which gives new bounds on model-checking for this large language for non-deterministic systems, and is particularly useful for probabilistic systems.
Checking LTL properties of recursive Markov chains
  • M. Yannakakis, K. Etessami
  • Computer Science, Mathematics
    Second International Conference on the Quantitative Evaluation of Systems (QEST'05)
  • 2005
These results improve by one exponential, in both the qualitative and quantitative case, the complexity that one would obtain if one first translated the LTL formula to a Buchi automaton and then applied the model checking algorithm from K. Etessami and M. Yannakakis.
An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems
This study shows that checking whether a probabilistic system satisfies an ω-automaton with positive probability can be solved in linear time for this kind of automata, and extends the study to the evaluation of this probability.
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words
This work proves precise structure theorems that characterize the exact expressive power of first-order logic with two variables on words, and proves, among other results, that there is a strict hierarchy of alternating quantifiers for both languages.
Playing Games with Boxes and Diamonds
New techniques for encoding Turing machine computations using games are introduced, and it is shown that deciding games for the Ltl fragment with only the always and eventually operators is 2Exptime-hard.
On the Complexity of LtlModel-Checking of Recursive State Machines
This paper systematically study the computational complexity of modelchecking RSMS against several syntactic fragments of LTL, and shows that if in the specification the authors disallow next and until, and retain only the box and diamond operators, model-checking is in NP.
The complexity of probabilistic verification
This work determines the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic and addresses questions for specifications described by ω-automata or formulas in extended temporal logic.
Analysis of recursive state machines
This study examines the verification of linear time properties of RSMs, and easily derive algorithms for linear time temporal logic model checking with the same complexity in the model.
The complexity of propositional linear temporal logics
We consider the complexity of satisfiability and determination of truth in a particular finite structure for different propositional linear temporal logics. We show that both the above problems are