Probabilistic automata on infinite words: Decidability and undecidability results

Krishnendu Chatterjee
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs of [GO09] and present a precise characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems.
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.