Optimal Paths in Weighted Timed Automata

By Rajeev Alur, S. L. Torre, George Pappas. International Conference on Hybrid Systems: Computation and Control, 2001

357 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Model Checking Real-Time Systems (2018, neutral): “Weighted timed automata [20, 33] is an intermediary model, extending timed automata with hybrid observer variables: these variables cannot appear in the guards of the automaton, but they can be used, for example, for optimization purposes.”
Linear Time Logic Control of Discrete-Time Linear Systems (2006, background): “More recent work includes controller synthesis for branching time specifications [42], decentralized control [43], [44], control of synchronous systems [45], [46] and synthesis for several different problems in timed automata including game theoretic approaches [47], scheduling [48], optimal control”
Efficient On-the-Fly Algorithms for the Analysis of Timed Games (2005, methodology): “More recently, timed automata technology has been successfully applied to optimal scheduling problems with guiding and pruning heuristics being added to yield on-the-fly algorithms which quickly lead to near-optimal (time- or cost-wise) schedules [5, 3, 11, 18].”
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (2008, background): “For example in the theory of TA there has been recently lots of research on extending timed automata with price/cost [60, 8, 28] and studying timed games [64, 39, 13, 12] as well as on-line testing [56, 61].”