Deciding the Value 1 Problem for Probabilistic Leaktight Automata

The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1? This problem was proved undecidable recently. We sharpen this result, showing that the undecidability holds even if the probabilistic automata have only one probabilistic transition. Our main contribution is to introduce a new class of probabilistic automata, called leaktight automata, for which the value 1 problem is shown decidable (and PSPACE-complete). We construct an algorithm based on the computation of a monoid abstracting the behaviors of the automaton, and rely on algebraic techniques developed by Simon for the correctness proof. The class of leaktight automata is decidable in PSPACE, subsumes all subclasses of probabilistic automata whose value 1 problem is known to be decidable (in particular deterministic automata), and is closed under two natural composition operators.

[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]  J. Howie.  Fundamentals of semigroup theory , 1995 .

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

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

[6]  Mehryar Mohri,et al.  LP Distance and Equivalence of Probabilistic Automata , 2007, Int. J. Found. Comput. Sci..

[7]  Sean R. Eddy,et al.  Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids , 1998 .

[8]  Daniel Kirsten,et al.  Distance desert automata and the star height problem , 2005, RAIRO Theor. Informatics Appl..

[9]  Nathanaël Fijalkow.  What is known about the Value 1 Problem for Probabilistic Automata? , 2014, ArXiv.

[10]  Thomas Colcombet,et al.  The Theory of Stabilisation Monoids and Regular Cost Functions , 2009, ICALP.

[11]  Imre Simon,et al.  On Semigroups of Matrices over the Tropical Semiring , 1994, RAIRO Theor. Informatics Appl..

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

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

[14]  Krishnendu Chatterjee,et al.  Algorithms for Omega-Regular Games with Incomplete Information ∗ , 2006 .

[15]  Krishnendu Chatterjee,et al.  Decidable Problems for Probabilistic Automata on Infinite Words , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[16]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[17]  G. Lallement.  Semigroups and combinatorial applications , 1979 .

[18]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[19]  Szymon Torunczyk.  Languages of Profinite Words and the Limitedness Problem , 2012, ICALP.

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

[21]  Alberto Bertoni,et al.  The Solution of Problems Relative to Probabilistic Automata in the Frame of the Formal Languages Theory , 1974, GI Jahrestagung.

[22]  Mahesh Viswanathan,et al.  Probabilistic Automata with Isolated Cut-Points , 2013, MFCS.

[23]  Krishnendu Chatterjee,et al.  Algorithms for Omega-Regular Games with Imperfect Information , 2006, Log. Methods Comput. Sci..

[24]  Wen-Guey Tzeng,et al.  A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata , 1992, SIAM J. Comput..

[25]  Hugo Gimbert,et al.  Pushing undecidability of the isolation problem for probabilistic automata , 2011, ArXiv.

[26]  Imre Simon.  Factorization Forests of Finite Height , 1990, Theor. Comput. Sci..

[27]  Thomas Colcombet.  Factorization forests for infinite words and applications to countable scattered linear orderings , 2010, Theor. Comput. Sci..

[28]  Mehryar Mohri,et al.  On the Computation of the Relative Entropy of Probabilistic Automata , 2008, Int. J. Found. Comput. Sci..

[29]  Jarkko Kari,et al.  Digital Images and Formal Languages , 1997, Handbook of Formal Languages.

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

[31]  Hugo Gimbert,et al.  A Class of Probabilistic Automata with a Decidable Value 1 Problem , 2011, ArXiv.

[32]  Thomas Colcombet.  Green's Relations and Their Use in Automata Theory , 2011, LATA.

[33]  Richard J. Lipton,et al.  On the complexity of space bounded interactive proofs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[34]  Hugo Gimbert,et al.  Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes , 2014, SOFSEM.