Optimal strategies in priced timed game automata (2004)
Cached
Download Links
- [www.irccyn.fr]
- [www.labri.fr]
- [www.lsv.ens-cachan.fr]
- [www.lsv.ens-cachan.fr]
- DBLP
Other Repositories/Bibliography
| Venue: | In FSTTCS 04, LNCS 3328 |
| Citations: | 38 - 17 self |
BibTeX
@INPROCEEDINGS{Bouyer04optimalstrategies,
author = {Patricia Bouyer and Franck Cassez and Emmanuel Fleury and Kim G. Larsen},
title = {Optimal strategies in priced timed game automata},
booktitle = {In FSTTCS 04, LNCS 3328},
year = {2004},
pages = {148--160},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost and we prove that it is decidable. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy. 1
