@inproceedings{14722ebe7f7043b3867f5ddffd578517,

title = "As cheap as possible : efficient cost-optimal reachability for priced timed automata",

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.",

author = "K.G. Larsen and G. Behrmann and E. Brinksma and A. Fehnker and T. Hune and P. Pettersson and J.M.T. Romijn",

year = "2001",

doi = "10.1007/3-540-44585-4_47",

language = "English",

isbn = "3-540-42345-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "493--505",

editor = "G. Berry and H. Comon and A. Finkel",

booktitle = "Computer aided verification : proceedings 13th international conference, CAV 2001, Paris, july 18-22, 2001",

address = "Germany",

}