Abstract Markov decision processes are a ubiquitous formalism for modelling systems with non-deterministic and probabilistic behavior. Verification of these models is subject to the famous state space explosion problem. We alleviate this problem by exploiting hierarchical structure repetitive parts. This not only occurs naturally in robotics, but also programs describing, e.g., network protocol...