Abstract
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability 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. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.
| Original language | English |
|---|---|
| Title of host publication | FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science |
| Subtitle of host publication | 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings |
| Editors | Kamal Lodaya, Meena Mahajan |
| Place of Publication | Berlin, Heidelberg |
| Publisher | Springer |
| Pages | 148-160 |
| ISBN (Electronic) | 978-3-540-30538-5 |
| ISBN (Print) | 978-3-540-24058-7 |
| DOIs | |
| Publication status | Published - 16 Dec 2004 |
| Externally published | Yes |
| Event | 24th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004 - Chennai, India Duration: 16 Dec 2004 → 18 Dec 2004 Conference number: 24 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 3328 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Workshop
| Workshop | 24th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004 |
|---|---|
| Abbreviated title | FSTTCS |
| Country/Territory | India |
| City | Chennai |
| Period | 16/12/04 → 18/12/04 |
Keywords
- n/a OA procedure