Theoretical Computer Science
The complexity of probabilistic verification
Journal of the ACM (JACM)
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The power of reachability testing for timed automata
Theoretical Computer Science
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Model Checking Markov Chains with Actions and State Labels
IEEE Transactions on Software Engineering
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Model Checking Timed and Stochastic Properties with CSL^{TA}
IEEE Transactions on Software Engineering
Delayed Nondeterminism in Continuous-Time Markov Decision Processes
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Numerical analysis of continuous time Markov decision processes over finite horizons
Computers and Operations Research
Stochastic real-time games with qualitative timed automata objectives
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Time-Bounded Reachability Probabilities in Continuous-Time Markov Decision Processes
QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
The ins and outs of the probabilistic model checker MRMC
Performance Evaluation
Measuring performance of continuous-time stochastic processes using timed automata
Proceedings of the 14th international conference on Hybrid systems: computation and control
Efficient CTMC model checking of linear real-time objectives
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
A characterization of meaningful schedulers for continuous-time markov decision processes
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Playing optimally on timed automata with random delays
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
This paper considers the verification of continuous-time Markov decision process (CTMDPs) against single-clock deterministic timed automata (DTA) specifications. The central issue is to compute the maximum probability of the set of timed paths of a CTMDP C that are accepted by a DTA A. We show that this problem can be reduced to a linear programming problem whose coefficients are maximum timed reachability probabilities in a set of CTMDPs, which are obtained via a graph decomposition of the product of the CTMDP C and the region graph of the DTA A.