@InProceedings{ BouyerCassezFleuryLarsen:FSTTCS:2004,
Author = "Bouyer, Patricia and Cassez, Franck and Fleury, Emmanuel and Larsen, Kim G.",
Editor = "Lodaya, Kamal and Mahajan, Meena",
Abstract = "Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.",
Address = "Berlin, Heidelberg",
BookTitle = "Proc. of FSTTCS'04",
date-added = "2020-02-06 18:57:09 +0100",
date-modified = "2020-02-06 18:57:34 +0100",
ISBN = "978-3-540-30538-5",
Pages = "148--160",
Publisher = "Springer Berlin Heidelberg",
Title = "Optimal Strategies in Priced Timed Game Automata",
Year = "2005",
File = "Optimal strategies in priced timed game automata - concur04 - a - a - a - z.pdf",
file-2 = "Optimal Strategies in Priced Timed Game Automata - BRICS-RS-04-4 - a - a - a - z.pdf"
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A