scientific article; zbMATH DE number 7649913

DOI10.4230/LIPICS.CONCUR.2019.5MaRDI QIDQ5875366FDOQ5875366

Jan Křetínský, Tobias Meggendorfer

Publication date: 3 February 2023

Title of this publication is not available (Why is that?)

zbMATH Keywords

approximationreachabilityMarkov decision processes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of probabilistic verification
• Title not available (Why is that?)
• Dynamic programming and optimal control. Vol. 2
• Performance analysis of probabilistic timed automata using digital clocks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reachability in MDPs: Refining Convergence of Value Iteration
• Title not available (Why is that?)
• Verification of Markov Decision Processes Using Learning Algorithms
• Sound value iteration
• Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes
• Value iteration for long-run average reward in Markov decision processes
• Title not available (Why is that?)
• Continuous-time Markov decisions based on partial exploration

Cited In (2)

• Comparison of algorithms for simple stochastic games
• Title not available (Why is that?)

Uses Software

• PRISM
• PASS
• Storm

This page was built for publication:

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