par Doyen, Laurent 
;Massart, Thierry ;Shirmohammadi, Mahsa
Référence Lecture notes in computer science, 6907, page (278-289)
Publication Publié, 2011
;Massart, Thierry ;Shirmohammadi, Mahsa Référence Lecture notes in computer science, 6907, page (278-289)
Publication Publié, 2011
Article révisé par les pairs
| Résumé : | Probabilistic automata are finite-state automata where the transitions are chosen according to fixed probability distributions. We consider a semantics where on an input word the automaton produces a sequence of probability distributions over states. An infinite word is accepted if the produced sequence is synchronizing, i.e. the sequence of the highest probability in the distributions tends to 1. We show that this semantics generalizes the classical notion of synchronizing words for deterministic automata. We consider the emptiness problem, which asks whether some word is accepted by a given probabilistic automaton, and the universality problem, which asks whether all words are accepted. We provide reductions to establish the PSPACE-completeness of the two problems. © 2011 Springer-Verlag GmbH. |
