Probabilistic ω-automata

  title={Probabilistic ω-automata},
  author={Christel Baier and Marcus Gr{\"o}\sser and Nathalie Bertrand},
  journal={J. ACM},
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all choices are resolved by probabilistic distributions. Acceptance of a run for an infinite input word can be defined using traditional acceptance criteria for ω-automata, such as Büchi, Rabin or Streett conditions. The accepted language of a probabilistic ω-automata is then defined by imposing a constraint on the probability measure of the accepting runs. In this paper, we study a series of… CONTINUE READING
20 Citations
9 References
Similar Papers


Publications citing this paper.

Similar Papers

Loading similar papers…