Skip to Main content Skip to Navigation
Conference papers

Improved Iterative Methods for Verifying Markov Decision Processes

Abstract : Value and policy iteration are powerful methods for verifying quantitative properties of Markov Decision Processes (MDPs). In order to accelerate these methods many approaches have been proposed. The performance of these methods depends on the graphical structure of MDPs. Experimental results show that they don’t work much better than normal value/policy iteration when the graph of the MDP is dense. In this paper we present an algorithm which tries to reduce the number of updates in dense MDPs. In this algorithm, instead of saving unnecessary updates we use graph partitioning method to have more important updates.
Document type :
Conference papers
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, January 26, 2017 - 10:43:31 AM
Last modification on : Thursday, January 26, 2017 - 10:57:19 AM
Long-term archiving on: : Friday, April 28, 2017 - 5:54:34 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Jaber Karimpour, Ayaz Isazadeh, Mohammadsadegh Mohagheghi, Khayyam Salehi. Improved Iterative Methods for Verifying Markov Decision Processes. 6th Fundamentals of Software Engineering (FSEN), Apr 2015, Tehran, Iran. pp.207-214, ⟨10.1007/978-3-319-24644-4_14⟩. ⟨hal-01446601⟩



Record views


Files downloads