Two Variable vs. Linear Temporal Logic in Model Checking and Games

DOI10.1007/978-3-642-23217-6_33zbMath1343.68151arXiv1303.4533OpenAlexW1506717375MaRDI 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

Mathematics Subject Classification ID

Applications of game theory (91A80) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Complexity of Two-Variable Logic on Finite Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Two Variable vs. Linear Temporal Logic in Model Checking and Games