Theoretical Computer Science
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
Robust Undecidability of Timed and Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Optimal Paths in Weighted Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Perturbed Turing Machines and Hybrid Systems
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
Robust safety of timed automata
Formal Methods in System Design
Improved undecidability results on weighted timed automata
Information Processing Letters
Information and Computation
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Optimal strategies in priced timed game automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Robust reachability in timed automata: a game-based approach
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
Weighted timed automata extend timed automata with cost variables that can be used to model the evolution of various quantities. Although cost-optimal reachability is decidable (in polynomial space) on this model, it becomes undecidable on weighted timed games. This paper studies cost-optimal reachability problems on weighted timed automata and games under robust semantics. More precisely, we consider two perturbation game semantics that introduce imprecisions in the standard semantics, and bring robustness properties w.r.t. timing imprecisions to controllers. We give a polynomial-space algorithm for weighted timed automata, and prove the undecidability of cost-optimal reachability on weighted timed games, showing that the problem is robustly undecidable.