An algorithmic approximation of the infimum reachability probability for Probabilistic Finite Automata

Details An algorithmic approximation of the infimum reachability probability for Probabilistic Finite Automata An algorithmic approximation of the infimum reachability probability for Probabilistic Finite Automata

2010-09-20

arxiv.org/abs/1009.3822v1

Computer Science

Logic in Computer Science

7 pages, 2 figures

Scientific paper

Given a Probabilistic Finite Automata (PFA), a set of states S, and an error threshold e > 0, our algorithm approximates the infimum probability (quantifying over all infinite words) that the automata reaches S. Our result contrasts with the known result that the approximation problem is undecidable if we consider the supremum instead of the infimum. Since we study the probability of reaching a set of states, instead of the probability of ending in an accepting state, our work is more related to model checking than to formal languages.

Affiliated with

Also associated with

No associations

Rating

An algorithmic approximation of the infimum reachability probability for Probabilistic Finite Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An algorithmic approximation of the infimum reachability probability for Probabilistic Finite Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An algorithmic approximation of the infimum reachability probability for Probabilistic Finite Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-264866