Two Variable vs. Linear Temporal Logic in Model Checking and Games
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 9 (2) , 497-511
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Structure Theorem and Strict Alternation Hierarchy for FO^2 on WordsLogical Methods in Computer Science, 2009
- On the Complexity of Ltl Model-Checking of Recursive State MachinesLecture Notes in Computer Science, 2007
- Analysis of recursive state machinesACM Transactions on Programming Languages and Systems, 2005
- Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations2005
- Playing Games with Boxes and Diamonds2003
- An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems2003
- First-Order Logic with Two Variables and Unary Temporal LogicInformation and Computation, 2002
- Small Progress Measures for Solving Parity Games2000
- Reachability analysis of pushdown automata: Application to model-checking1997
- The complexity of probabilistic verificationJournal of the ACM, 1995