Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata
| |
|
As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata
Kim Larsen6, 7, Gerd Behrmann6, Ed Brinksma7, Ansgar Fehnker9, Thomas Hune8, Paul Pettersson10 and Judi Romijn9
| (6) |
Basic Research in Computer Science, Aalborg University, Aalborg |
| (7) |
Department of Computer Systems, University of Twente, UK |
| (8) |
Basic Research in Computer Science, Aarhus University, Aarhus |
| (9) |
University of Nijmegen, Computing Science Institute, Nijmegen |
| (10) |
Department of Information Technology, Uppsala University, Uppsala |
Abstract
In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal state in the model of Linearly
Priced Timed Automata (LPTA). The central contribution of this paper is a priced extension of so-called zones. This, together
with a notion of facets of a zone, allows the entire machinery for symbolic reachability for timed automata in terms of zones
to be lifted to cost-optimal reachability using priced zones. We report on experiments with a cost-optimizing extension of
Uppaal on a number of examples.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|