Two Variable vs. Linear Temporal Logic in Model Checking and Games
From MaRDI portal
Publication:3090852
DOI10.1007/978-3-642-23217-6_33zbMath1343.68151arXiv1303.4533MaRDI QIDQ3090852
Michael Benedikt, Rastislav Lenhardt, James Worrell
Publication date: 2 September 2011
Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.4533
91A80: Applications of game theory
03D05: Automata and formal grammars in connection with logical questions
68Q60: Specification and verification (program logics, model checking, etc.)
03B44: Temporal logic
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Cites Work
- A survey of stochastic \(\omega \)-regular games
- First-order logic with two variables and unary temporal logic
- Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
- The complexity of propositional linear temporal logics
- The complexity of probabilistic verification
- On the Complexity of Ltl Model-Checking of Recursive State Machines
- STACS 2005
- CONCUR 2003 - Concurrency Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item