Delayed Nondeterminism in Continuous-Time Markov Decision Processes

DOI10.1007/978-3-642-00596-1_26zbMath1234.68320OpenAlexW2168234479WikidataQ57801538 ScholiaQ57801538MaRDI QIDQ3617741

Martin R. Neuhäußer, Mariëlle I. A. Stoelinga, Joost-Pieter Katoen

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_26

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (8)

Markov automata with multiple objectives ⋮ Three-valued abstraction for probabilistic systems ⋮ Confluence reduction for Markov automata ⋮ A uniformization-based algorithm for continuous-time stochastic games model checking ⋮ On Lexicographic Proof Rules for Probabilistic Termination ⋮ The How and Why of Interactive Markov Chains ⋮ Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games ⋮ Efficient approximation of optimal control for continuous-time Markov games

Cites Work

• A survey of recent results on continuous-time Markov decision processes (with comments and rejoinder)
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes
• A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
• Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
• Continuous-time probabilistic automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Delayed Nondeterminism in Continuous-Time Markov Decision Processes