One-Clock Priced Timed Games with Arbitrary Weights - Archive ouverte HAL Access content directly
Journal Articles Logical Methods in Computer Science Year : 2022

One-Clock Priced Timed Games with Arbitrary Weights

Abstract

Priced timed games are two-player zero-sum games played on priced timed au-tomata (whose locations and transitions are labeled by weights modeling the price of spending time in a state and executing an action, respectively). The goals of the players are to minimise and maximise the price to reach a target location, respectively. We consider priced timed games with one clock and arbitrary integer weights and show that, for an important subclass of theirs (the so-called simple priced timed games), one can compute, in exponential time, the optimal values that the players can achieve, with their associated optimal strategies. As side results, we also show that one-clock priced timed games are determined and that we can use our result on simple priced timed games to solve the more general class of so-called negative-reset-acyclic priced timed games (with arbitrary integer weights and one clock). The decidability status of the full class of priced timed games with one-clock and arbitrary integer weights still remains open.
Fichier principal
Vignette du fichier
2009.03074.pdf (727.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02424743 , version 1 (28-12-2019)
hal-02424743 , version 2 (27-09-2022)

Identifiers

  • HAL Id : hal-02424743 , version 2

Cite

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege. One-Clock Priced Timed Games with Arbitrary Weights. Logical Methods in Computer Science, 2022, 18 (3), pp.51. ⟨hal-02424743v2⟩
190 View
73 Download

Share

Gmail Facebook X LinkedIn More