| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428218 | Information Processing Letters | 2007 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
