The value problem for weighted timed games with two clocks is undecidable

DOI10.1007/978-3-032-22730-0_29MaRDI QIDQ7317508zbMATH OpenFDO

Authors Quentin Guilmant, Joël Ouaknine, Isa Vialard

Publication date 24 August 2026

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-22730-0_29

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• 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?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Improved undecidability results on weighted timed automata
• Inaproximability in weighted timed games
• Modularity for timed and hybrid systems
• On reachability for hybrid automata over bounded time
• On the synthesis of discrete controllers for timed systems
• On the Value Problem in Weighted Timed Games.
• Optimal controller synthesis for timed systems
• Time-bounded reachability for monotonic hybrid automata: complexity and fixed points
• Time-Bounded Verification
• Towards a theory of time-bounded verification

This page was built for publication: The value problem for weighted timed games with two clocks is undecidable

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