Simple Priced Timed Games Are Not That Simple

Abstract : Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modeling the costs of spending time in a state and executing an action, respectively). The goals of the players are to minimise and maximise the cost to reach a target location, respectively. We consider priced timed games with one clock and arbitrary (positive and negative) 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 reset-acyclic priced timed games (with arbitrary weights and one-clock).
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01452621
Contributor : Benjamin Monmege <>
Submitted on : Thursday, February 2, 2017 - 9:33:28 AM
Last modification on : Monday, March 4, 2019 - 2:04:27 PM
Long-term archiving on : Friday, May 5, 2017 - 11:33:45 AM

File

main.pdf
Files produced by the author(s)

Licence


Copyright

Identifiers

Citation

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege. Simple Priced Timed Games Are Not That Simple. Proceedings of the 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), Dec 2015, Bangalore, India. pp.278-292, ⟨10.4230/LIPIcs.FSTTCS.2015.p⟩. ⟨hal-01452621⟩

Share

Metrics

Record views

392

Files downloads

44