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

DOI10.1007/11867340_25zbMATH Open1141.68517OpenAlexW1556729131MaRDI QIDQ3511248FDOQ3511248

Authors: 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

Recommendations

• Delayed Nondeterminism in Continuous-Time Markov Decision Processes
• Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
• Optimal time-abstract schedulers for CTMDPs and Markov games
• Tools and Algorithms for the Construction and Analysis of Systems
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes

Mathematics Subject Classification ID

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

Cited In (10)

• Three-valued abstraction for probabilistic systems
• Efficient approximation of optimal control for continuous-time Markov games
• The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
• Deciding Simulations on Probabilistic Automata
• Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
• Title not available (Why is that?)
• Cost vs. time in stochastic games and Markov automata
• A Note on Greedy Policies for Scheduling Scalar Gauss-Markov Systems
• Delayed Nondeterminism in Continuous-Time Markov Decision Processes
• Computing Behavioral Relations for Probabilistic Concurrent Systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511248)