Inaproximability in weighted timed games

DOI10.4230/LIPICS.CONCUR.2024.27MaRDI QIDQ6859921zbMATH OpenFDO

Authors Quentin Guilmant, Joël Ouaknine

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2024.27

zbMATH Keywords

approximationundecidabilityweighted timed games

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A faster algorithm for solving one-clock priced timed games
• Adding negative prices to priced timed games
• Almost Optimal Strategies in One Clock Priced Timed Games
• Automata, Languages and Programming
• Decidability of one-clock weighted timed games with arbitrary weights
• Formal Modeling and Analysis of Timed Systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 1361131 (Why is no real title available?)
• Improved undecidability results on weighted timed automata
• Modularity for timed and hybrid systems
• On the synthesis of discrete controllers for timed systems
• On the undecidability of probabilistic planning and related stochastic optimization problems
• On the Value Problem in Weighted Timed Games.
• One-clock priced timed games with negative weights
• Optimal controller synthesis for timed systems
• Optimal reachability in divergent weighted timed games
• Simple priced timed games are not that simple
• Symbolic Approximation of Weighted Timed Games
• Time-Bounded Verification
• Two-player reachability-price games on single-clock timed automata

Cited in

(1)

• Reachability for multi-priced timed automata with positive and negative rates

This page was built for publication: Inaproximability in weighted timed games

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