Decidability of one-clock weighted timed games with arbitrary weights

DOI10.4230/LIPICS.CONCUR.2022.15MaRDI QIDQ6587121zbMATH OpenFDO

Authors Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier

Publication date 13 August 2024

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

zbMATH Keywords

algorithmic game theorytimed automataweighted timed games

Mathematics Subject Classification ID

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

Recommendations

• Optimal controller synthesis for timed systems
• Optimal reachability in divergent weighted timed games
• On the Value Problem in Weighted Timed Games.
• One-clock priced timed games with negative weights

Cited in

(4)

• Inaproximability in weighted timed games
• Decidability of one-clock weighted timed games with arbitrary weights
• Synthesis of robust optimal real-time systems
• The value problem for weighted timed games with two clocks is undecidable

This page was built for publication: Decidability of one-clock weighted timed games with arbitrary weights

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