Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Algorithms for the Multi-constrained Routing Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Optimal Paths in Weighted Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Better is Better than Well: On Efficient Verification of Infinite-State Systems
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Optimal scheduling using priced timed automata
ACM SIGMETRICS Performance Evaluation Review
On model-checking timed automata with stopwatch observers
Information and Computation
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
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
Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Weighted Timed Automata: Model-Checking and Games
Electronic Notes in Theoretical Computer Science (ENTCS)
On model-checking timed automata with stopwatch observers
Information and Computation
Model-checking one-clock priced timed automata
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Deciding an interval logic with accumulated durations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A theory of duration calculus with application
Domain modeling and the duration calculus
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
A Kleene-Schützenberger theorem for weighted timed automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science
Almost optimal strategies in one clock priced timed games
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Priced timed automata: algorithms and applications
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Verification, performance analysis and controller synthesis for real-time systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Statistical model checking, refinement checking, optimization, … for stochastic hybrid systems
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Lower-bound-constrained runs in weighted timed automata
Performance Evaluation
| Hi-index | 0.00 |
In this paper, we prove decidability of the optimal conditional reachability problem for multi-priced timed automata, an extension of timed automata with multiple cost variables evolving according to given rates for each location. More precisely, we consider the problem of determining the minimal cost of reaching a given target state, with respect to some primary cost variable, while respecting upper bound constraints on the remaining (secondary) cost variables. Decidability is proven by constructing a zone-based algorithm that always terminates while synthesizing the optimal cost with a single secondary cost variable. The approach is then lifted to any number of secondary cost variables.