DMCA
Optimal Paths in Weighted Timed Automata (2001)
Cached
Download Links
- [www.seas.upenn.edu]
- [www.georgejpappas.org]
- [www.cis.upenn.edu]
- [www.cis.upenn.edu]
- [www.seas.upenn.edu]
- [www.georgejpappas.org]
- DBLP
Other Repositories/Bibliography
| Venue: | HSCC |
| Citations: | 124 - 5 self |
BibTeX
@INPROCEEDINGS{Alur01optimalpaths,
author = {Rajeev Alur and Salvatore La Torre and George J. Pappas},
title = {Optimal Paths in Weighted Timed Automata},
booktitle = {HSCC},
year = {2001},
pages = {49--62},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to a (parametric) shortest-path problem for a finite directed graph. The directed graph we construct is a refinement of the region automaton due to Alur and Dill. We present an exponential time algorithm to solve the shortest-path problem for weighted timed automata starting from a single state, and a doubly-exponential time algorithm to solve this problem starting from a zone of the state space.
