Synthesis of Optimal Strategies Using HyTech

  • Authors:
  • Patricia Bouyer;Franck Cassez;Emmanuel Fleury;Kim G. Larsen

  • Affiliations:
  • LSV, UMR 8643, CNRS & ENS de Cachan, France;IRCCyN, UMR 6597, CNRS, France;Computer Science Department, BRICS, Aalborg University, Denmark;Computer Science Department, BRICS, Aalborg University, Denmark

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. 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.