Probabilistic Acceptors for Languages over Infinite Words

Probabilistic ω-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word requires that the probability for the accepting runs is positive. In this paper, we provide a summary of the fundamental properties of probabilistic ω-automata concerning expressiveness, efficiency, compositionality and decision problems.

[1]  George E. Monahan,et al.  A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms , 2007 .

[2]  W. Lovejoy.  A survey of algorithmic methods for partially observed Markov decision processes , 1991 .

[3]  L. D. Alfaro.  The Verification of Probabilistic Systems Under Memoryless Partial-Information Policies is Hard , 1999 .

[4]  Moshe Y. Vardi,et al.  On ω-automata and temporal logic , 1989, STOC '89.

[5]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[6]  Edward J. Sondik,et al.  The Optimal Control of Partially Observable Markov Processes over a Finite Horizon , 1973, Oper. Res..

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

[8]  Azaria Paz,et al.  Some aspects of Probabilistic Automata , 1966, Inf. Control..

[9]  Jozef Gruska,et al.  Mathematical Foundations of Computer Science 1981 , 1981, Lecture Notes in Computer Science.

[10]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[11]  Krishnendu Chatterjee,et al.  Algorithms for Omega-Regular Games with Imperfect Information, , 2006, CSL.

[12]  Andris Ambainis,et al.  1-way quantum finite automata: strengths, weaknesses and generalizations , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

[14]  Cynthia Dwork,et al.  A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata , 1990, SIAM J. Comput..

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

[16]  Marcus Größer,et al.  Reduction methods for probabilistic model checking , 2008 .

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

[18]  John Watrous,et al.  On the power of quantum finite state automata , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[19]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[20]  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.

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

[22]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[24]  Rusins Freivalds,et al.  Probabilistic Two-Way Machines , 1981, MFCS.

[25]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[26]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[27]  G. Monahan.  State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms , 1982 .

[28]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

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