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
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
Theoretical Computer Science - Logic, semantics and theory of programming
Computation: finite and infinite machines
Computation: finite and infinite machines
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
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Lower-bound-constrained runs in weighted timed automata
Performance Evaluation
| Hi-index | 0.00 |
A weighted timed automaton is a timed automaton equipped with weights on transitions and weight rates on locations. These weights may be positive or negative, corresponding to the production and consumption of some resources. We consider the interval-bound problem: does there exist an infinite run such that the accumulated weight for each prefix of the run is within some given bounds? We show that this problem is undecidable if the weighted timed automaton has more than one clock and more than one weight variable. We further prove that the problem is PSPACE-complete if we restrict the time domain to the natural numbers.