Value iteration
Chatterjee K, Henzinger TA. 2008.Value iteration. In: 25 Years in Model Checking. LNCS, vol. 5000, 107–138.
Download
No fulltext has been uploaded. References only!
Book Chapter
| Published
Series Title
LNCS
Abstract
We survey value iteration algorithms on graphs. Such algorithms can be used for determining the existence of certain paths (model checking), the existence of certain strategies (game solving), and the probabilities of certain events (performance analysis). We classify the algorithms according to the value domain (boolean, probabilistic, or quantitative); according to the graph structure (nondeterministic, probabilistic, or multi-player); according to the desired property of paths (Borel level 1, 2, or 3); and according to the alternation depth and convergence rate of fixpoint computations.
Publishing Year
Date Published
2008-01-01
Book Title
25 Years in Model Checking
Publisher
Springer
Acknowledgement
This research was supported in part by the Swiss National Science Foundation and by the NSF grants CCR-0225610 and CCR-0234690.
Volume
5000
Page
107 - 138
IST-REx-ID
Cite this
Chatterjee K, Henzinger TA. Value iteration. In: 25 Years in Model Checking. Vol 5000. Springer; 2008:107-138. doi:10.1007/978-3-540-69850-0_7
Chatterjee, K., & Henzinger, T. A. (2008). Value iteration. In 25 Years in Model Checking (Vol. 5000, pp. 107–138). Springer. https://doi.org/10.1007/978-3-540-69850-0_7
Chatterjee, Krishnendu, and Thomas A Henzinger. “Value Iteration.” In 25 Years in Model Checking, 5000:107–38. Springer, 2008. https://doi.org/10.1007/978-3-540-69850-0_7.
K. Chatterjee and T. A. Henzinger, “Value iteration,” in 25 Years in Model Checking, vol. 5000, Springer, 2008, pp. 107–138.
Chatterjee K, Henzinger TA. 2008.Value iteration. In: 25 Years in Model Checking. LNCS, vol. 5000, 107–138.
Chatterjee, Krishnendu, and Thomas A. Henzinger. “Value Iteration.” 25 Years in Model Checking, vol. 5000, Springer, 2008, pp. 107–38, doi:10.1007/978-3-540-69850-0_7.
Google Scholar