Abstract
AbstractProbabilistic Büchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open. PBA are known to accept, in general, a class of languages that goes beyond the regular languages. In this work we extend the known classes of restricted PBA which are still regular, strongly relying on notions concerning ambiguity in classical $$\omega $$
ω
-automata. Furthermore, we investigate the expressivity of the not yet considered but natural class of weak PBA, and we also show that the regularity problem for weak PBA is undecidable.
Publisher
Springer International Publishing
Reference25 articles.
1. Baier, C., Bertrand, N., Größer, M.: On decision problems for probabilistic büchi automata. In: Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008. Lecture Notes in Computer Science, vol. 4962, pp. 287–301. Springer (2008), https://doi.org/10.1007/978-3-540-78499-9
2. Baier, C., Bertrand, N., Größer, M.: Probabilistic automata over infinite words: Expressiveness, efficiency, and decidability. In: Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009. EPTCS, vol. 3, pp. 3–16 (2009), https://doi.org/10.4204/EPTCS.3
3. Baier, C., Größer, M.: Recognizing omega-regular languages with probabilistic automata. In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings. pp. 137–146 (2005)
4. Baier, C., Größer, M., Bertrand, N.: Probabilistic $$\omega $$-automata. Journal of the ACM (JACM) 59(1), 1 (2012)
5. Baier, C., Katoen, J.: Principles of model checking. MIT Press (2008)