Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Sound Value Iteration   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.

37
The categories of this paper are: supr-con
17
The categories of this paper are: q-fin
6
The categories of this paper are: astro-ph
2
The categories of this paper are: math
18
The categories of this paper are: econ
32
The categories of this paper are: atom-ph
7
The categories of this paper are: hep-th
36
The categories of this paper are: cmp-lg
27
The categories of this paper are: comp-gas
22
The categories of this paper are: chao-dyn
25
The categories of this paper are: patt-sol
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
12
The categories of this paper are: nucl-th
34
The categories of this paper are: chem-ph
8
The categories of this paper are: hep-ex