1. Baier, C., Größer, M.: Recognizing $$\omega $$-regular languages with probabilistic automata. In: 20th IEEE Symposium on Logic in Computer Science, pp. 137–146 (2005)
2. Ben, Y.: Model Checking Open Probabilistic Systems using Hierarchical probabilistic automata. Ph.D. thesis, University of Illinois, Chicago (2016)
3. Ben, Y., Chadha, R., Sistla, A.P., Viswanathan, M.: Decidable and expressive classes of probabilistic automata. https://www.cs.uic.edu/pub/Sistla/Publications/HPAjournal2016.pdf (2016). Manuscript under review
4. Lecture Notes in Computer Science;Y Ben,2015
5. Lecture Notes in Computer Science;A Bertoni,1975