2026-07-23T18:08:58Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:25458 2026-03-19T13:28:51Z ddc:004 open_access

Deciding the Value of Two-Clock Almost Non-Zeno Weighted Timed Games Vialard, Isa Weighted timed games decidability real-time systems The Value Problem for weighted timed games (wtgs) consists in determining, given a two-player weighted timed game with a reachability objective and a rational threshold, whether or not the value of the game exceeds the threshold. When restrained to wtgs with non-negative weight, this problem is known to be undecidable for weighted timed games with three or more clocks, and decidable for one-clock wtgs. The Value Problem for two-clock non-negative wtgs, which remained stubbornly open for a decade, was recently shown to be undecidable. In this paper, we show that the Value Problem is decidable when considering two-clock almost non-Zeno wtgs. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Isa Vialard 2026 Is Part Of LIPIcs, Volume 363, 34th EACSL Annual Conference on Computer Science Logic (CSL 2026) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2026.33 urn:nbn:de:0030-drops-254580 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2026.33 eng https://creativecommons.org/licenses/by/4.0/legalcode