CPS Real-Time, CPS Formal Methods
Date of this Version
Lecture Notes in Computer Science: Automata, Languages and Programming
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.
The original publication is available at www.springerlink.com
Rajeev Alur, Mikhail Bernadsky, and P. Madhusudan, "Optimal Reachability for Weighted Timed Games", Lecture Notes in Computer Science: Automata, Languages and Programming 3142, 122-133. July 2004. http://dx.doi.org/10.1007/978-3-540-27836-8_13
Date Posted: 22 December 2005