Of cores: a partial-exploration framework for Markov decision processes

MaRDI QIDQ5129946zbMATH OpenFDO

Authors Jan Křetínský, Tobias Meggendorfer

Publication date 3 November 2020

Full work available at URL https://arxiv.org/abs/1906.06931, https://lmcs.episciences.org/6833

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• Of cores: a partial-exploration framework for Markov decision processes
• Continuous-time Markov decisions based on partial exploration
• Verification of Markov decision processes using learning algorithms
• CEGAR for compositional analysis of qualitative properties in Markov decision processes

Cites work

• A Survey of Applications of Markov Decision Processes
• An \(O(n^2)\) time algorithm for alternating Büchi games
• Continuous-time Markov decisions based on partial exploration
• Depth-First Search and Linear Graph Algorithms
• Dynamic programming and optimal control. Vol. 2
• Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
• Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
• scientific article; zbMATH DE number 3128787 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 2087806 (Why is no real title available?)
• scientific article; zbMATH DE number 2090703 (Why is no real title available?)
• scientific article; zbMATH DE number 2090709 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Performance analysis of probabilistic timed automata using digital clocks
• Reachability in MDPs: refining convergence of value iteration
• Semantic labelling and learning for parity game solving in LTL synthesis
• Sound value iteration
• Stochastic invariants for probabilistic termination
• The complexity of probabilistic verification

Cited in

(8)

• Value iteration for simple stochastic games: stopping criterion and learning algorithm
• Comparison of algorithms for simple stochastic games
• Of cores: a partial-exploration framework for Markov decision processes
• Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
• Abstraction-Refinement for Hierarchical Probabilistic Models
• Correct approximation of stationary distributions
• Robust almost-sure reachability in multi-environment MDPs
• Learning algorithms for verification of Markov decision processes

Describes a project that uses

Uses Software

• PRISM
• GNU parallel
• PASS
• Storm

This page was built for publication: Of cores: a partial-exploration framework for Markov decision processes

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