Login / Signup
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata.
Kim Guldstrand Larsen
Gerd Behrmann
Ed Brinksma
Ansgar Fehnker
Thomas Hune
Paul Pettersson
Judi Romijn
Published in:
CAV (2001)
Keyphrases
</>
timed automata
expected cost
dynamic programming
high cost
upper bound
minimum cost
machine learning
artificial intelligence
state space
computationally efficient
software systems
cost sensitive
total cost
long run
optimal cost