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.
State Explosion in Almost-Sure Probabilistic Reachability
SPROSTON, Jeremy James
2007-01-01
Abstract
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
