Synthesis of Optimal Strategies Using HyTech
Résumé
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]
Origine : Fichiers produits par l'(les) auteur(s)