Optimal Strategies in Priced Timed Game Automata

Optimal Strategies in Priced Timed Game Automata

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science 2004-01, p.148-160
Hauptverfasser: Bouyer, Patricia, Cassez, Franck, Fleury, Emmanuel, Larsen, Kim G.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Goal State
Optimal Control Problem
Optimal Cost
Optimal Strategy
Schedule Problem
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-30538-5_13