Anytime guarantees for reachability in uncountable Markov decision processes

DOI10.4230/LIPICS.CONCUR.2022.11MaRDI QIDQ6587117zbMATH OpenFDO

Authors Kush Grover, Jan Křetínský, Tobias Meggendorfer, Maximilian Weininger

Publication date 13 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2022.11

zbMATH Keywords

anytime guaranteediscrete-time Markov control processMarkov decision processprobabilistic verificationuncountable system

Mathematics Subject Classification ID

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

This page was built for publication: Anytime guarantees for reachability in uncountable Markov decision processes

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