@inproceedings{af1f00d5af7c44a384d4165f4818f7dc,
title = "Synthesis of optimal strategies using HyTeCH",
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.",
author = "Patricia Bouyer and Franck Cassez and Emmanuel Fleury and Larsen, {Kim G.}",
year = "2005",
doi = "10.1016/j.entcs.2004.07.006",
language = "English",
series = "Electronic Notes in Theoretical Computer Science",
publisher = "Elsevier",
number = "1",
pages = "11--31",
editor = "{de Alfaro}, L.",
booktitle = "Proceedings of the Workshop on Games in Design and Verification (GDV 2004)",
note = "Workshop on Games in Design and Verification, GDV 2004, GDV ; Conference date: 18-06-2004 Through 18-06-2004",
}