A uniform Tauberian theorem in dynamic programming
Mathematics of Operations Research
Theoretical Computer Science
Competitive Markov decision processes
Competitive Markov decision processes
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
As Soon as Possible: Time Optimal Control for Timed Automata
HSCC '99 Proceedings of the Second 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
Concavely-Priced Timed Automata
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Model checking SystemC designs using timed automata
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
Automatic Synthesis of Robust and Optimal Controllers --- An Industrial Case Study
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Discount-Optimal Infinite Runs in Priced Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Concavely-Priced Probabilistic Timed Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Expected reachability-time games
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Timed automata based analysis of embedded system architectures
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Priced timed automata: algorithms and applications
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Minimum-time reachability in timed games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Model checking for probabilistic timed automata
Formal Methods in System Design
Hi-index | 0.00 |
Quantitative analysis and controller synthesis problems for reactive real-time systems can be formalized as optimization problems on timed automata, timed games, and their probabilistic extensions. The limiting average cost and the discounted cost are two standard criteria for such optimization problems. In theory of finite-state probabilistic systems, a number of interesting results are available relating the optimal values according to these two different performance objectives. These results, however, do not directly apply to timed systems due to the infinite state-space of clock valuations. In this paper, we present some conditions under which the existence of the limit of optimal discounted cost objective implies the the existence of limiting average cost to the same value. Using these results we answer an open question posed by Fahrenberg and Larsen, and give simpler proofs of some known decidability results on (probabilistic) timed automata. We also show the determinacy and decidability of average-time games on timed automata, and expected average-time games on probabilistic timed automata.