Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes

DOI10.1007/978-3-642-54830-7_5zbMath1405.68229arXiv1310.2514OpenAlexW1510075073MaRDI QIDQ5410665

Hongfei Fu

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.2514

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Applications of continuous-time Markov processes on discrete state spaces (60J28) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Cost vs. time in stochastic games and Markov automata ⋮ Efficient approximation of optimal control for continuous-time Markov games

This page was built for publication: Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes