Résumé |
Priced timed games are two-player zero-sum games played on priced
timed automata (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
or maximise the price to reach a target location.
While one can compute the optimal values that the players can achieve
(and their associated optimal strategies) when the weights are all
positive, this problem with arbitrary integer weights remains open.
In this talk, I will explain what makes this case more difficult and
show how to solve the problem for a subclass of priced timed
games (the so-called simple priced timed games). |