Article Dans Une Revue Logical Methods in Computer Science Année : 2025

Decidability of One-Clock Weighted Timed Games with Arbitrary Weights

Benjamin Monmege
Julie Parreaux
  • Fonction : Auteur
  • PersonId : 1499377
Pierre-Alain Reynier
  • Fonction : Auteur
  • PersonId : 1499378

Résumé

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 WTGs have 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).

Fichier principal
Vignette du fichier
2207.01608.pdf (825.23 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
licence

Dates et versions

hal-04920306 , version 1 (30-01-2025)

Licence

Identifiants

Citer

Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier. Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. Logical Methods in Computer Science, 2025, Volume21,Issue1, ⟨10.46298/lmcs-21(1:8)2025⟩. ⟨hal-04920306⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More