2026-07-22T16:46:25Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17078 2024-03-06T10:58:41Z ddc:004 open_access

Decidability of One-Clock Weighted Timed Games with Arbitrary Weights Monmege, Benjamin Parreaux, Julie Reynier, Pierre-Alain Weighted timed games Algorithmic game theory Timed automata Weighted Timed Games (WTG for short) are the most widely used model to describe controller synthesis problems involving real-time issues. Unfortunately, they are notoriously difficult, and undecidable in general. As a consequence, one-clock WTG has attracted a lot of attention, especially because they are known to be decidable when only non-negative weights are allowed. However, when arbitrary weights are considered, despite several recent works, their decidability status was still unknown. In this paper, we solve this problem positively and show that the value function can be computed in exponential time (if weights are encoded in unary). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Benjamin Monmege and Julie Parreaux and Pierre-Alain Reynier 2022 Is Part Of LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2022.15 urn:nbn:de:0030-drops-170786 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.15 eng https://creativecommons.org/licenses/by/4.0/legalcode