Parameter-Independent Strategies for pMDPs via POMDPs

DOI10.1007/978-3-319-99154-2_4zbMath1514.68190arXiv1806.05126OpenAlexW2963451394WikidataQ124212530 ScholiaQ124212530MaRDI QIDQ6104800

Joost-Pieter Katoen, Ezio Bartocci, Krishnendu Chatterjee, Ana Sokolova, Sebastian Arming

Publication date: 28 June 2023

Published in: Quantitative Evaluation of Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.05126

zbMATH Keywords

reachability objectivesMarkov decision process (MDP)parametric MDPspartially observable MDPs (POMDP)reachability probabilities

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Scenario-Based Verification of Uncertain MDPs ⋮ Parameter synthesis in Markov models: a gentle survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal cost almost-sure reachability in POMDPs
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Parametric probabilistic transition systems for system design and analysis
• Computational complexity and feasibility of data processing and interval computations
• Parameter synthesis for Markov models: faster than ever
• POMDPs under probabilistic semantics
• Model Repair for Probabilistic Systems
• Sequential Convex Programming for the Efficient Verification of Parametric MDPs
• ARES: Adaptive Receding-Horizon Synthesis of Optimal Plans
• Fast randomized consensus using shared memory
• Randomness for Free
• Qualitative Analysis of Partially-Observable Markov Decision Processes
• A Probabilistic Small Model Theorem to Assess Confidentiality of Dispersed Cloud Storage
• Probabilistic ω-automata
• Theoretical Aspects of Computing - ICTAC 2004

This page was built for publication: Parameter-Independent Strategies for pMDPs via POMDPs