Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910801845026816 |
|---|---|
| author | Monmege, Benjamin Parreaux, Julie Reynier, Pierre-Alain |
| author_facet | Monmege, Benjamin Parreaux, Julie Reynier, Pierre-Alain |
| contents | 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). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2207_01608 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Decidability of One-Clock Weighted Timed Games with Arbitrary Weights Monmege, Benjamin Parreaux, Julie Reynier, Pierre-Alain Computer Science and Game Theory 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). |
| title | Decidability of One-Clock Weighted Timed Games with Arbitrary Weights |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2207.01608 |