Minimum and maximum delay problems in real-time systems
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Theoretical Computer Science
Timed automata and additive clock constraints
Information Processing Letters
An Undecidable Problem for Timed Automata
Discrete Event Dynamic Systems
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
Optimal scheduling using priced timed automata
ACM SIGMETRICS Performance Evaluation Review
Infinite Runs in Weighted Timed Automata with Energy Constraints
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Timed automata with observers under energy constraints
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Quantitative analysis of real-time systems using priced timed automata
Communications of the ACM
On the interval-bound problem for weighted timed automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
On reachability for hybrid automata over bounded time
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Energy games in multiweighted automata
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Segmented state space traversal for conformance testing of cyber-physical systems
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Optimal conditional reachability for multi-priced timed automata
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Hi-index | 0.00 |
We investigate a number of problems related to infinite runs of weighted timed automata (with a single weight variable), subject to lower-bound constraints on the accumulated weight. Closing an open problem from Bouyer et al. (2008), we show that the existence of an infinite lower-bound-constrained run is-for us somewhat unexpectedly-undecidable for weighted timed automata with four or more clocks. This undecidability result assumes a fixed and known initial credit. We show that the related problem of existence of an initial credit for which there exists a feasible run is decidable in PSPACE. We also investigate the variant of these problems where only bounded-duration runs are considered, showing that this restriction makes our original problem decidable in NEXPTIME. We prove that the universal versions of all those problems (i.e, checking that all the considered runs satisfy the lower-bound constraint) are decidable in PSPACE. Finally, we extend this study to multi-weighted timed automata: the existence of a feasible run becomes undecidable even for bounded duration, but the existence of initial credits remains decidable (in PSPACE).