We report on a novel development to model check quantitative reachability properties on Markov decision processes together
with its prototype implementation. The innovation of the technique is that the analysis is performed on an abstraction of
the model under analysis. Such an abstraction is significantly smaller than the original model and may safely refute or accept
the required property. Otherwise, the abstraction is refined and the process repeated. As the numerical analysis necessary
to determine the validity of the property is more costly than the refinement process, the technique profits from applying
such numerical analysis on smaller state spaces.
Supported by the STW-PROGRESS project TES-4999