@InProceedings{ AlurBernadskyMadhusudan:ICALP:2004,
Author = "Alur, Rajeev and Bernadsky, Mikhail and Madhusudan, P.",
Editor = {D{\'\i}az, Josep and Karhum{\"a}ki, Juhani and Lepist{\"o}, Arto and Sannella, Donald},
Abstract = "Weighted timed automata are timed automata annotated with costs on locations and transitions. The optimal game-reachability problem for these automata is to find the best-cost strategy of supplying the inputs so as to ensure reachability of a target set within a specified number of iterations. The only known complexity bound for this problem is a doubly-exponential upper bound. We establish a singly-exponential upper bound and show that there exist automata with exponentially many states in a single region with pair-wise distinct optimal strategies.",
Address = "Berlin, Heidelberg",
BookTitle = "Proc. of ICALP'04",
date-added = "2020-02-06 18:58:46 +0100",
date-modified = "2020-02-06 18:59:26 +0100",
ISBN = "978-3-540-27836-8",
Pages = "122--133",
Publisher = "Springer Berlin Heidelberg",
Title = "Optimal Reachability for Weighted Timed Games",
Year = "2004",
File = "Optimal reachability for weighted timed games - icalp04 - a - a - a - p.pdf"
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A