The complexity of Markov decision processes
Mathematics of Operations Research
Theoretical Computer Science
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
On probabilistic timed automata
Theoretical Computer Science
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Optimal Paths in Weighted Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Verifying Progress in Timed Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Convex Optimization
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
Probably on Time and within BudgetOn Reachability in Priced Probabilistic Timed Automata
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
State explosion in almost-sure probabilistic reachability
Information Processing Letters
Symbolic model checking for probabilistic timed automata
Information and Computation
Optimal reachability for multi-priced timed automata
Theoretical Computer Science
Optimal infinite scheduling for multi-priced timed automata
Formal Methods in System Design
Concavely-Priced Timed Automata
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Expected reachability-time games
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Relating average and discounted costs for quantitative analysis of timed systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Efficient model-checking of dense-time systems with time-convexity analysis
Theoretical Computer Science
Model-based performance testing in the cloud using the mbpet tool
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
Model checking for probabilistic timed automata
Formal Methods in System Design
| Hi-index | 0.00 |
Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavely-priced probabilistic timed automata for arbitrary initial states. We prove that these problems are EXPTIME-complete for probabilistic timed automata with two or more clocks and PTIME-complete for automata with one clock. Previous work on expected price problems for probabilistic timed automata was restricted to expected reachability for linearly-priced automata and integer valued initial states. This work uses the boundary region graph introduced by Jurdziński and Trivedi to analyse properties of concavely-priced (non-probabilistic) timed automata.