Name
Abstract | ||
|---|---|---|
Computing reachability probabilities is at the heart of probabilistic model checking. All model checkers compute these probabilities in an iterative fashion using value iteration. This technique approximates a fixed point from below by determining reachability probabilities for an increasing number of steps. To avoid results that are significantly off, variants have recently been proposed that converge from both below and above. These procedures require starting values for both sides. We present an alternative that does not require the a priori computation of starting vectors and that converges faster on many benchmarks. The crux of our technique is to give tight and safe bounds whose computation is cheap on the reachability probabilities. Lifting this technique to expected rewards is trivial for both Markov chains and MDPs. Experimental results on a large set of benchmarks show its scalability and efficiency. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-96145-3_37 | COMPUTER AIDED VERIFICATION (CAV 2018), PT I |
DocType | Volume | ISSN |
Conference | 10981 | 0302-9743 |
Citations | PageRank | References |
1 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tim Quatmann | 1 | 25 | 2.30 |
| Joost-Pieter Katoen | 2 | 4444 | 289.65 |