Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- 21 November 2005
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 345 (1), 2-26
- https://doi.org/10.1016/j.tcs.2005.07.022
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision ProcessesLecture Notes in Computer Science, 2004
- Model-checking algorithms for continuous-time markov chainsIEEE Transactions on Software Engineering, 2003
- Model-checking large structured Markov chainsThe Journal of Logic and Algebraic Programming, 2003
- On Optimal Scheduling under UncertaintyLecture Notes in Computer Science, 2003
- Model-checking continuous-time Markov chainsACM Transactions on Computational Logic, 2000
- Model checking for a probabilistic branching time logic with fairnessDistributed Computing, 1998
- Model checking of probabilistic and nondeterministic systemsLecture Notes in Computer Science, 1995
- Exact and ordinary lumpability in finite Markov chainsJournal of Applied Probability, 1994
- Uniformization for semi-Markov decision processes under stationary policiesJournal of Applied Probability, 1987
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or MakespanJournal of the ACM, 1981