Optimal Strategies in Priced Timed Game Automata

Patricia Bouyer (1) , Franck Cassez (2) , Emmanuel Fleury (3) , Kim Guldstrand Larsen (4)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique
4 CISS - Center for Indlejrede Software Systemer

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.

Domaines: Autre [cs.OH]

Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen. Optimal Strategies in Priced Timed Game Automata. 24th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'04), 2004, Chennai, India. pp.148-160, ⟨10.1007/b104325_13⟩. ⟨hal-00350483⟩