Open AccessOptimal Strategies in Priced Timed Game Automata
Author(s) -
Patricia Bouyer,
Franck Cassez,
Emmanuel Fleury,
Kim Guldstrand Larsen
Publication year - 2004
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1007/b104325_13
Subject(s) - automaton , computer science , game theory , theoretical computer science , mathematical economics , economics
International audiencePriced 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