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

Larsen, Kim and Behrmann, Gerd and Brinksma, Ed and Fehnker, Ansgar and Hune, Thomas and Petterson, Paul and Romijn, Judi (2001) As Cheap as Possible:Efficient Cost-Optimal Reachability for Priced Timed Automata. In: 13th International Conference on Computer Aided Verification, CAV 2001, July 18-22, 2001, Paris, France.

PDF
Restricted to UT campus only: Request a copy
234Kb

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.
Item Type:	Conference or Workshop Item
Copyright:	© 2001 Springer
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Formal Methods and Tools (FMT)
Link to this item:	http://purl.utwente.nl/publications/63285
Official URL:	http://dx.doi.org/10.1007/3-540-44585-4_47
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 205778