A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes

DOI10.1007/11867340_25zbMath1141.68517OpenAlexW1556729131MaRDI QIDQ3511248

Nicolás Wolovick, Sven Johr

Publication date: 8 July 2008

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

Full work available at URL: https://doi.org/10.1007/11867340_25

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

Cost vs. time in stochastic games and Markov automata ⋮ Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ Deciding Simulations on Probabilistic Automata ⋮ Three-valued abstraction for probabilistic systems ⋮ Unnamed Item ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ Delayed Nondeterminism in Continuous-Time Markov Decision Processes ⋮ Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games ⋮ Efficient approximation of optimal control for continuous-time Markov games

This page was built for publication: A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes