Distributed Qualitative LTL Model Checking of Markov Decision Processes
| Authors | |
|---|---|
| Year of publication | 2006 |
| Type | Article in Proceedings |
| Conference | Proceedings of 5th International Workshop on Parallel and Distributed Methods in verifiCation |
| MU Faculty or unit | |
| Citation | |
| Field | Informatics |
| Keywords | distributed; parallel; LTL model checking; probabilistic systems; MDP |
| Description | Markov decision processes are used to model concurrent programs that exhibit uncertainty. The state explosion problem for probabilistic systems is more critical than in the non-probabilistic case. In the paper we propose a cluster-based algorithm for qualitative LTL model checking of finite state Markov decision processes. We use the automata approach which reduces the model checking problem to the question of existence of an accepting end component. The algorithm uses repeated reachability which systematically eliminates states that cannot belong to any accepting end component. A distinguished feature of the distributed algorithm is that its complexity meets the complexity of the best known sequential algorithm. |
| Related projects: |