KNAW

Publication

As Cheap as Possible:Efficient Cost-Optimal Reachability for Priced Timed Automata (2001)

Pagina-navigatie:
Title As Cheap as Possible:Efficient Cost-Optimal Reachability for Priced Timed Automata
Author Larsen, Kim; Behrmann, Gerd; Brinksma, Ed; Fehnker, Ansgar; Hune, Thomas; Petterson, Paul; Romijn, Judi
Editor Berry, G.; Comon, H.; Finkel, A.
Date 2001
Type conference object
Publisher Springer Verlag
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.
Publication http://purl.utwente.nl/publications/63285
Persistent Identifier URN:NBN:NL:UI:28-63285
Metadata XML
Repository University of Twente
University of Twente

Go to page top
Go back to contents
Go back to site navigation