  Simple stochastic games are turn-based 2.5-player games with a reachability
objective. The basic question asks whether one player can ensure reaching a
given target with at least a given probability. A natural extension is games
with a conjunction of such conditions as objective. Despite a plethora of
recent results on the analysis of systems with multiple objectives, the
decidability of this basic problem remains open. In this paper, we present an
algorithm approximating the Pareto frontier of the achievable values to a given
precision. Moreover, it is an anytime algorithm, meaning it can be stopped at
any time returning the current approximation and its error bound.
