Synthesis of optimal strategies using HyTeCH

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

13 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
Title of host publicationProceedings of the Workshop on Games in Design and Verification (GDV 2004)
Subtitle of host publication18 June 2004, Boston, MA, USA
EditorsL. de Alfaro
Place of PublicationDordrecht
Publication statusPublished - 2005
Externally publishedYes
EventWorkshop on Games in Design and Verification, GDV 2004 - Boston, United States
Duration: 18 Jun 200418 Jun 2004

Publication series

NameElectronic Notes in Theoretical Computer Science
ISSN (Print)1571-0661


WorkshopWorkshop on Games in Design and Verification, GDV 2004
Abbreviated titleGDV
Country/TerritoryUnited States


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

Cite this