%0 Conference Proceedings
%F BaierBG09
%A Baier, C.
%A Bertrand, N.
%A Grosser, M.
%T Probabilistic Acceptors for Languages over Infinite Words
%B 35th Conference on Current Trends in Theory and Practice of Computer Science
%V 5404
%P 19-33
%S LNCS
%C Spindleruv Mlyn, Czech
%X Probabilistic omega-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 omega-automata concerning expressiveness, efficiency, compositionality and decision problems
%U http://www.irisa.fr/vertecs/Publis/Ps/2009-sofsem.pdf
%U http://dx.doi.org/10.1007/978-3-540-95891-8_3
%D 2009