PlumX Metrics
Embed PlumX Metrics

State explosion in almost-sure probabilistic reachability

Information Processing Letters, ISSN: 0020-0190, Vol: 102, Issue: 6, Page: 236-241
2007
  • 14
    Citations
  • 0
    Usage
  • 7
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    14
    • Citation Indexes
      14
  • Captures
    7

Article Description

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.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know