Optimal bounds in parametric LTL games

DOI10.1016/j.tcs.2012.07.039zbMath1296.03015OpenAlexW2019700891MaRDI QIDQ391106

Martín G. Zimmermann

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.039

zbMATH Keywords

infinite gamesoptimal winning strategiesparametric linear temporal logicPROMPT-LTL

Mathematics Subject Classification ID

Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items

Delay Games with WMSO$$+$$U Winning Conditions, Parameterized linear temporal logics meet costs: still not costlier than LTL, Robust, expressive, and quantitative linear temporal logics: pick any two for free, Delay Games with WMSO+U Winning Conditions, Markov chains and unambiguous automata, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Parametric metric interval temporal logic, Parametric linear dynamic logic, Distributed synthesis for parameterized temporal logics, Prompt Interval Temporal Logic, On relation between linear temporal logic and quantum finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real-time logics: Complexity and expressiveness
• From liveness to promptness
• Automata, logics, and infinite games. A guide to current research
• Finitary winning in ω-regular games
• Parametric temporal logic for “model measuring”
• Parametric Metric Interval Temporal Logic
• The complexity of propositional linear temporal logics
• From LTL to Symbolically Represented Deterministic Automata