Abstract
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. In this paper, we present an algorithm for computing the optimal cost and for synthesizing an optimal strategy in case there exists one. We also describe the implementation of this algorithm with the tool HyTech and present an example.
Original language | English |
---|---|
Pages (from-to) | 11-31 |
Number of pages | 21 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 119 |
Issue number | SPEC. ISS. |
DOIs | |
Publication status | Published - 2 Feb 2005 |
Externally published | Yes |
Keywords
- Optimal control
- Strategy synthesis
- Timed systems