Probabilistic Weighted Automata

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L (w ). The value of an infinite word w is computed as the maximal value of all runs over w , and the value of a run as the supremum, limsup, liminf, limit average, or discounted sum of the transition weights. We introduce probabilistic weighted automata, in which the transitions are chosen in a randomized (rather than nondeterministic) fashion. Under almost-sure semantics (resp. positive semantics), the value of a word w is the largest real v such that the runs over w have value at least v with probability 1 (resp. positive probability). We study the classical questions of automata theory for probabilistic weighted automata: emptiness and universality, expressiveness, and closure under various operations on languages. For quantitative languages, emptiness and universality are defined as whether the value of some (resp. every) word exceeds a given threshold. We prove some of these questions to be decidable, and others undecidable. Regarding expressive power, we show that probabilities allow us to define a wide variety of new classes of quantitative languages, except for discounted-sum automata, where probabilistic choice is no more expressive than nondeterminism. Finally, we give an almost complete picture of the closure of various classes of probabilistic weighted automata for the following pointwise operations on quantitative languages: max, min, sum, and numerical complement.

[1]  Zoltán Ésik,et al.  An Algebraic Generalization of omega-Regular Languages , 2004, MFCS.

[2]  Krishnendu Chatterjee,et al.  Qualitative Analysis of Partially-Observable Markov Decision Processes , 2009, MFCS.

[3]  Krishnendu Chatterjee,et al.  Compositional Quantitative Reasoning , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[4]  Krishnendu Chatterjee,et al.  Verifying Quantitative Properties Using Bound Functions , 2005, CHARME.

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

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

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

[8]  Krishnendu Chatterjee,et al.  Quantitative Languages , 2008, CSL.

[9]  Thomas A. Henzinger,et al.  Resource Interfaces , 2003, EMSOFT.

[10]  Krishnendu Chatterjee,et al.  Quantitative stochastic parity games , 2004, SODA '04.

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

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

[13]  Krishnendu Chatterjee,et al.  Quantitative languages , 2008, TOCL.

[14]  Luca de Alfaro,et al.  Linear and Branching Metrics for Quantitative Transition Systems , 2004, ICALP.

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

[16]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[17]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

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

[19]  Karel Culik,et al.  Finite Automata Computing Real Functions , 1994, SIAM J. Comput..

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

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

[22]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[23]  Manfred Droste,et al.  Skew and infinitary formal power series , 2003, Theor. Comput. Sci..

[24]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[25]  Krishnendu Chatterjee,et al.  Alternating Weighted Automata , 2009, FCT.

[26]  Krishnendu Chatterjee,et al.  Expressiveness and Closure Properties for Quantitative Languages , 2009, LICS.

[27]  Krishnendu Chatterjee,et al.  Expressiveness and Closure Properties for Quantitative Languages , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.