Probabilistic Automata on Finite Words: Decidable and Undecidable Problems

This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Emptiness Problem asks, given some probability 0 ≤ λ ≤ 1, whether there exists a word accepted with probability greater than λ, and the Isolation Problem asks whether there exist words whose acceptance probability is arbitrarily close to λ. Both these problems are known to be undecidable [11, 4, 3]. About the Emptiness problem, we provide a new simple undecidability proof and prove that it is undecidable for automata with as few as two probabilistic transitions. The Value 1 Problem is the special case of the Isolation Problem when λ = 1 or λ = 0. The decidability of the Value 1 Problem was an open question. We show that the Value 1 Problem is undecidable. Moreover, we introduce a new class of probabilistic automata, #-acyclic automata, for which the Value 1 Problem is decidable.

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

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

[3]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[5]  Anne Condon,et al.  On the undecidability of probabilistic planning and related stochastic optimization problems , 2003, Artif. Intell..

[6]  Giancarlo Mauri,et al.  Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata , 1977, ICALP.

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

[8]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[9]  Vincent D. Blondel,et al.  Undecidable Problems for Probabilistic Automata of Fixed Dimension , 2003, Theory of Computing Systems.

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

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

[12]  Wiebe van der Hoek,et al.  SOFSEM 2007: Theory and Practice of Computer Science , 2007 .

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

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

[15]  Rajeev Alur,et al.  Distinguishing tests for nondeterministic and probabilistic machines , 1995, STOC '95.

[16]  Mika Hirvensalo,et al.  Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages , 2007, SOFSEM.

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