Maximizing the Conditional Expected Reward for Reaching the Goal

DOI10.1007/978-3-662-54580-5_16zbMath1453.90180arXiv1701.05389OpenAlexW2580113371MaRDI QIDQ3303934

Sascha Wunderlich, Sascha Klüppelholz, Joachim Klein, Christel Baier

Publication date: 5 August 2020

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

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

zbMATH Keywords

conditional expectationMarkov decision processthreshold algorithmmaximal pathgoal state

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Markov and semi-Markov decision processes (90C40)

Related Items (3)

Multi-cost bounded tradeoff analysis in MDP ⋮ Unnamed Item ⋮ Nearly Optimal Verifiable Data Streaming

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information hiding in probabilistic concurrent systems
• Iterated Palm conditioning and some Slivnyak-type theorems for Cox and cluster processes
• Temporal Specifications with Accumulative Values
• Compositional methods for information-hiding
• Understanding Probabilistic Programs
• An Analysis of Stochastic Shortest Path Problems
• Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
• Synthesizing Probabilistic Invariants via Doob’s Decomposition
• Weight monitoring with linear temporal logic
• Variations on the Stochastic Shortest Path Problem
• Markov Decision Processes with Multiple Long-run Average Objectives
• Probabilistic Model Checking for Energy-Utility Analysis
• Decisive Markov Chains
• Conditional Probabilities over Probabilistic and Nondeterministic Systems
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Conditioning in probabilistic programming

This page was built for publication: Maximizing the Conditional Expected Reward for Reaching the Goal