Synthesis of optimal strategies using HyTech

Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim G. Larsen

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


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]. 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.

Original languageEnglish
Pages (from-to)11-31
Number of pages21
JournalElectronic Notes in Theoretical Computer Science
Issue numberSPEC. ISS.
Publication statusPublished - 2 Feb 2005
Externally publishedYes


  • Optimal control
  • Strategy synthesis
  • Timed systems

Fingerprint Dive into the research topics of 'Synthesis of optimal strategies using HyTech'. Together they form a unique fingerprint.

Cite this