scientific article; zbMATH DE number 7649913

DOI10.4230/LIPIcs.CONCUR.2019.5MaRDI QIDQ5875366

Jan Křetínský, Tobias Meggendorfer

Publication date: 3 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Markov decision processesreachabilityapproximation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Unnamed Item ⋮ Comparison of algorithms for simple stochastic games

Uses Software

• PRISM
• PASS
• Storm

Cites Work

• Performance analysis of probabilistic timed automata using digital clocks
• Value iteration for long-run average reward in Markov decision processes
• Reachability in MDPs: Refining Convergence of Value Iteration
• Verification of Markov Decision Processes Using Learning Algorithms
• The complexity of probabilistic verification
• Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes
• Sound value iteration
• Continuous-time Markov decisions based on partial exploration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: