This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European projects VHS [22] and AMETIST [17] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [20,5] specialized for cost-optimal reachability for the extended model of priced timed automata. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Behrmann, G., Larsen, K. G., & Rasmussen, J. I. (2005). Priced timed automata: Algorithms and applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3657 LNCS, pp. 162–182). https://doi.org/10.1007/11561163_8
Mendeley helps you to discover research relevant for your work.