@inproceedings{601c22d89f4e400d9f3917b8c5dc02ed,
title = "Efficient guiding towards cost-optimality in UPPAAL",
abstract = "In this paper we present an algorithm for efficiently computing the minimum cost of reaching a goal state in the model of Uniformly Priced Timed Automata (UPTA). This model can be seen as a submodel of the recently suggested model of linearly priced timed automata, which extends timed automata with prices on both locations and transitions. The presented algorithm is based on a symbolic semantics of UTPA, and an efficient representation and operations based on difference bound matrices. In analogy with Dijkstra{\textquoteright}s shortest path algorithm, we show that the search order of the algorithm can be chosen such that the number of symbolic states explored by the algorithm is optimal, in the sense that the number of explored states can not be reduced by any other search order. We also present a number of techniques inspired by branch-and-bound algorithms which can be used for limiting the search space and for quickly finding near-optimal solutions.",
author = "Gerd Behrmann and Ansgar Fehnker and Thomas Hune and Kim Larsen and Paul Pettersson and Judi Romijn",
year = "2001",
doi = "10.1007/3-540-45319-9_13",
language = "English",
isbn = "3540418652",
series = "Lecture Notes in Computer Science",
publisher = "Springer, Springer Nature",
pages = "174--188",
editor = "Tiziana Margaria and Wang Yi",
booktitle = "Tools and Algorithms for the Construction and Analysis of Systems",
address = "United States",
note = "7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2001 held as part of the Europ ean Joint Conference on Theory and Practice of Software, ETAPS 2015 ; Conference date: 02-04-2001 Through 06-04-2001",
}