1 citations · 2 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2022★ 1 cited
Under-Approximating Expected Total Rewards in POMDPs
Alexander Bork, Joost-Pieter Katoen, Tim Quatmann
We consider the problem: is the optimal expected total reward to reach a goal state in a partially observable Markov decision process (POMDP) below a given threshold? We tackle thi…
cs.AI2020
Verification of indefinite-horizon POMDPs
Alexander Bork, Sebastian Junges, Joost-Pieter Katoen +1
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 veri…