Optimal bounds in parametric LTL games

DOI10.1016/J.TCS.2012.07.039MaRDI QIDQ391106zbMATHOpenAlexFDO

Authors Martin 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)

Recommendations

• Optimal bounds in parametric LTL games
• Parameterized linear temporal logics meet costs: still not costlier than LTL
• Parameterized linear temporal logics meet costs: still not costlier than LTL
• Parametric temporal logic for “model measuring”
• Publication:4938622

Cites work

• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Automata, logics, and infinite games. A guide to current research
• Finitary winning in \({\omega}\)-regular games
• From LTL to Symbolically Represented Deterministic Automata
• From liveness to promptness
• Optimal bounds in parametric LTL games
• Parametric Metric Interval Temporal Logic
• Parametric temporal logic for “model measuring”
• Real-time logics: Complexity and expressiveness
• The complexity of propositional linear temporal logics

Cited in

(17)

• scientific article; zbMATH DE number 1948167 (Why is no real title available?)
• Parameterized linear temporal logics meet costs: still not costlier than LTL
• Distributed PROMPT-LTL synthesis
• Delay games with WMSO+U winning conditions
• On relation between linear temporal logic and quantum finite automata
• Prompt interval temporal logic
• Approximating optimal bounds in prompt-LTL realizability in doubly-exponential time
• Optimal strategies in weighted limit games
• Parameterized linear temporal logics meet costs: still not costlier than LTL
• Optimal bounds in parametric LTL games
• Parametric linear dynamic logic
• Markov chains and unambiguous automata
• Parametric metric interval temporal logic
• Robust, expressive, and quantitative linear temporal logics: pick any two for free
• Robust, expressive, and quantitative linear temporal logics: pick any two for free
• Distributed synthesis for parameterized temporal logics
• Delay games with WMSO+U winning conditions

This page was built for publication: Optimal bounds in parametric LTL games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391106)