Logo der Universität Wien

Faster and Dynamic Algorithms For Maximal End-Component Decomposition And Related Graph Problems In Probabilistic Verification

Abstract

We present faster and dynamic algorithms for the following problems arising in probabilistic verification: Computation of the maximal end-component (mec) decomposition of Markov decision processes (MDPs), and of the almost sure winning set for reachability and parity ob jectives in MDPs. We achieve the following running time for static algorithms in MDPs with graphs of n vertices and m edges: (1) O(m·min{√m, n^(2/3)}) for the mec decomposition, improving the longstanding O(m·n) bound; (2) O(m·n^(2/3) for reachability objectives, improving the previous O(m·√m) bound for m > n^(4/3); and (3) O(m·min{√m, n^(2/3)}·log(d)) for parity objectives with d priorities, improving the previous O(m·√m·d) bound. We also give incremental and decremental algorithms in linear time for mec decomposition and reachability objectives and O(m·log d) time for parity objectives. ) for reachabilityP

GrafikTop
Authors
GrafikTop
Citation
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
Symposium on Discrete Algorithms (SODA)
Divisions
Theory and Applications of Algorithms
Event Location
San Francisco, USA
Event Type
Conference
Event Dates
2010-09-28
Date
23 January 2011
Export
GrafikTop
Contact us
Faculty of Computer Science
University of Vienna

Währinger Straße 29
A-1090 Vienna