Name
Abstract | ||
|---|---|---|
The verification problem in MDPs asks whether, for any policy resolving the nondeterminism, the probability that something bad happens is bounded by some given threshold. This verification problem is often overly pessimistic, as the policies it considers may depend on the complete system state. This paper considers the verification problem for partially observable MDPs, in which the policies make their decisions based on (the history of) the observations emitted by the system. We present an abstraction-refinement framework extending previous instantiations of the Lovejoy-approach. Our experiments show that this framework significantly improves the scalability of the approach. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/978-3-030-59152-6_16 | ATVA |
DocType | Citations | PageRank |
Conference | 1 | 0.34 |
References | Authors | |
28 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Bork | 1 | 1 | 0.34 |
| Sebastian Junges | 2 | 184 | 20.78 |
| Joost-Pieter Katoen | 3 | 7 | 4.45 |
| Tim Quatmann | 4 | 5 | 1.07 |