The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Verification of Markov Decision Processes Using Learning Algorithms
Open accessAbstract
We present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an exhaustive exploration of the state space. Our framework focuses on probabilistic reachability, which is a core property for verification, and is illustrated through two distinct instantiations. The first assumes that full knowledge of the MDP is available, and performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. The second tackles the case where we may only sample the MDP, and yields probabilistic guarantees, again in terms of both the lower and upper bounds, which provides efficient stopping criteria for the approximation. The latter is the first extension of statistical model checking for unbounded properties in MDPs. In contrast with other related techniques, our approach is not restricted to time-bounded (finite-horizon) or discounted properties, nor does it assume any particular properties of the MDP. We also show how our methods extend to LTL objectives. We present experimental results showing the performance of our framework on several examples.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees
McMahan, H. B., Likhachev, M., & Gordon, G. J. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102423 · Cited by 128 · cited 25×
“So we consider bounded RTDP (BRTDP) [31], which supplements this with an additional upper bound.”
BackgroundMethodInfluential
Cited by
A Storm is Coming: A Modern Probabilistic Model Checker
Dehnert, C., Junges, S., Katoen, J.-P., & Volk, M. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63390-9_31 · Cited by 401
Liu, T., Zou, Y., Liu, D., & Sun, F. (2015) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2015.2475419 · Cited by 278
Metadata
- Authors
- Brázdil, T., Chatterjee, K., Chmelík, M., Forejt, V., Křetínský, J., Kwiatkowska, M., Parker, D., & Ujma, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2014
- Pages
- 98-114
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1556387789
- Cited by
- 178
- References
- 2
- FWCI
- 8.48
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Verification of Markov Decision Processes Using Learning Algorithms. https://app.cochat.ai/papers/10.1007/978-3-319-11936-6_8
- The paper
- Brázdil, T., Chatterjee, K., Chmelík, M., Forejt, V., Křetínský, J., Kwiatkowska, M., Parker, D., & Ujma, M. (2014). Verification of Markov Decision Processes Using Learning Algorithms. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-11936-6_8
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.