State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilistic-nondeterministic systems operating in parallel is EXPTIME-complete. We then show that this probabilistic reachability problem is EXPTIME-complete also for probabilistic timed automata. (c) 2007 Published by Elsevier B.V.
timed automata probabilistic systems model checking computational complexity formal methods