A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
From MaRDI portal
Publication:3511248
DOI10.1007/11867340_25zbMath1141.68517MaRDI QIDQ3511248
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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Efficient approximation of optimal control for continuous-time Markov games, Three-valued abstraction for probabilistic systems, Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games, The metric linear-time branching-time spectrum on nondeterministic probabilistic processes, Cost vs. time in stochastic games and Markov automata, Computing Behavioral Relations for Probabilistic Concurrent Systems, Unnamed Item, Deciding Simulations on Probabilistic Automata, Delayed Nondeterminism in Continuous-Time Markov Decision Processes