Publication | Open Access

Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes

Reachability AnalysisEfficient ComputationEngineeringReachability ProblemProbabilistic VerificationTime-bounded Reachability ProbabilitiesSystems EngineeringComputational ComplexityMarkov Decision ProcessesProbabilistic ComputationProbability TheoryComputer ScienceCombinatorial OptimizationMarkov Decision Process