Reachability in Recursive Markov Decision Processes
DOI10.1007/11817949_24zbMATH Open1151.68509OpenAlexW1506542859MaRDI QIDQ5756595FDOQ5756595
Authors: Tomáš Brázdil, Václav Brožek, Vojtech Forejt, Antonin Kučera 
Publication date: 4 September 2007
Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.178.6733
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (12)
- Forward Recursion for Markov Decision Processes with Skip-Free-to-the-Right Transitions, Part I: Theory and Algorithm
- Enforcing almost-sure reachability in POMDPs
- Qualitative reachability in stochastic BPA games
- Qualitative reachability in stochastic BPA games
- Reachability in recursive Markov decision processes
- Qualitative analysis of VASS-induced MDPs
- Title not available (Why is that?)
- Approximating the termination value of one-counter MDPs and stochastic games
- Nested Reachability Approximation for Discrete-Time Markov Chains with Univariate Parameters
- Reachability problems for Markov chains
- Reachability and safety objectives in Markov decision processes on long but finite horizons
- Reachability analysis of uncertain systems using bounded-parameter Markov decision processes
This page was built for publication: Reachability in Recursive Markov Decision Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756595)
