Decidable Problems for Probabilistic Automata on Infinite Words

We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with positive probability; (ii) the almost decision problem asks whether there is a word that is accepted with probability 1; and (iii) the limit decision problem asks whether words are accepted with probability arbitrarily close to 1. We unify and generalize several decidability results for probabilistic automata over infinite words, and identify a robust (closed under union and intersection) subclass of probabilistic automata for which all the qualitative decision problems are decidable for parity conditions. We also show that if the input words are restricted to lasso shape (regular) words, then the positive and almost problems are decidable for all probabilistic automata with parity conditions. For most decidable problems we show an optimal PSPACE-complete complexity bound.

[1]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[2]  Azaria Paz,et al.  Introduction to probabilistic automata (Computer science and applied mathematics) , 1971 .

[3]  Vincent Gripon,et al.  Qualitative Concurrent Stochastic Games with Imperfect Information , 2009, ICALP.

[4]  Hugo Gimbert,et al.  Probabilistic Automata on Finite Words: Decidable and Undecidable Problems , 2010, ICALP.

[5]  Mahesh Viswanathan,et al.  On the Expressiveness and Complexity of Randomization in Finite State Monitors , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[6]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[7]  Christel Baier,et al.  Recognizing /spl omega/-regular languages with probabilistic automata , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[8]  D. Blackwell.  Finite Non-Homogeneous Chains , 1945 .

[9]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[10]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[11]  Christel Baier,et al.  Probabilistic ω-automata , 2012, JACM.

[12]  I. Sonin.  The asymptotic behaviour of a general finite nonhomogeneous Markov chain (the decomposition-separation theorem) , 1996 .

[13]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[14]  Christel Baier,et al.  On Decision Problems for Probabilistic Büchi Automata , 2008, FoSSaCS.

[15]  H. Cohn.  PRODUCTS OF STOCHASTIC MATRICES AND APPLICATIONS , 1989 .

[16]  Hugo Gimbert,et al.  Deciding the Value 1 Problem for Probabilistic Leaktight Automata , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[17]  Azaria Paz,et al.  Probabilistic automata , 2003 .

[18]  Krishnendu Chatterjee,et al.  Partial-Observation Stochastic Games: How to Win When Belief Fails , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[19]  Allan F. Abrahamse.  The Tail Field of a Markov Chain , 1969 .

[20]  Christel Baier,et al.  Recurrence and Transience for Probabilistic Automata , 2009, FSTTCS.

[21]  Krishnendu Chatterjee,et al.  Probabilistic Automata on Infinite Words: Decidability and Undecidability Results , 2010, ATVA.

[22]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[23]  Nathalie Bertrand,et al.  Qualitative Determinacy and Decidability of Stochastic Games with Signals , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[24]  Michel de Rougemont,et al.  Statistic Analysis for Probabilistic Processes , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[25]  Mahesh Viswanathan,et al.  Power of Randomization in Automata on Infinite Strings , 2009, CONCUR.

[26]  David A. Freedman,et al.  The Tail $\sigma$-Field of a Markov Chain and a Theorem of Orey , 1964 .