Synthesis of Optimal Strategies Using HyTech

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. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [6]. 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.

Domaines: Autre [cs.OH]

Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen. Synthesis of Optimal Strategies Using HyTech. Workshop on Games in Design and Verification (GDV'04), 2004, Boston, United States. pp.11-31, ⟨10.1016/j.entcs.2004.07.006⟩. ⟨hal-00350478⟩