Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |

Download [help]

Download paper Adobe portable document format (pdf)

Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

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.

Contact

Nathalie Bertrand
nathalie.bertrand@irisa.fr

BibTex Reference

@InProceedings{BaierBG09,
   Author = {Baier, C. and Bertrand, N. and Grosser, M.},
   Title = {Probabilistic Acceptors for Languages over Infinite Words},
   BookTitle = {35th Conference on Current Trends in Theory and Practice of Computer Science, LNCS No 5404},
   Address = {Spindleruv Mlyn, Czech},
   Year = {2009}
}

EndNote Reference [help]

Get EndNote Reference (.ref)