Advertisement

Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata

  • Rohit ChadhaEmail author
  • A. Prasad Sistla
  • Mahesh Viswanathan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10203)

Abstract

k-Hierarchical probabilistic automata (k-HPA) are probabilistic automata whose states are stratified into \(k+1\) levels such that from any state, on any input symbol, at most one successor belongs to the same level, while the remaining belong to higher levels. Our main result shows that the emptiness and universality problems are decidable for k-HPAs with isolated cut-points; recall that a cut-point x is isolated if the acceptance probability of every word is bounded away from x. Our algorithm for establishing this result relies on computing an approximation of the value of an HPA; the value of a probabilistic automaton is the supremum of the acceptance probabilities of all words. Computing the exact value of a probabilistic automaton is an equally important problem and we show that the problem is co-R.E.-complete for k-HPAs, for \(k \ge 2\) (as opposed to \(\mathbf {\Pi ^{0}_{{2}}}\)-complete for general probabilistic automata). On the other hand, we also show that for 1-HPAs the value can be computed in exponential time.

Notes

Acknowledgements

We thanks the anonymous reviewers for their useful comments and suggestions. Rohit Chadha was partially supported by NSF CNS 1314338 and NSF CNS 1553548. A. Prasad Sistla was partially supported by NSF CCF 1319754 and NSF CNS 1314485. Mahesh Viswanathan was partially supported by NSF CNS 1314485.

References

  1. 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)Google Scholar
  2. 2.
    Ben, Y.: Model Checking Open Probabilistic Systems using Hierarchical probabilistic automata. Ph.D. thesis, University of Illinois, Chicago (2016)Google Scholar
  3. 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. 4.
    Ben, Y., Sistla, A.P.: Model checking failure-prone open systems using probabilistic automata. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 148–165. Springer, Cham (2015). doi: 10.1007/978-3-319-24953-7_11 CrossRefGoogle Scholar
  5. 5.
    Bertoni, A.: The solution of problems relative to probabilistic automata in the frame of the formal languages theory. In: Siefkes, D. (ed.) GI 1974. LNCS, vol. 26, pp. 107–112. Springer, Heidelberg (1975). doi: 10.1007/3-540-07141-5_213 CrossRefGoogle Scholar
  6. 6.
    Chadha, R., Kini, D., Viswanathan, M.: Decidable problems for unary PFAs. In: Norman, G., Sanders, W. (eds.) QEST 2014. LNCS, vol. 8657, pp. 329–344. Springer, Cham (2014). doi: 10.1007/978-3-319-10696-0_26 Google Scholar
  7. 7.
    Chadha, R., Sistla, A.P., Viswanathan, M.: On the expressiveness and complexity of randomization in finite state monitors. J. ACM 56(5) (2009)Google Scholar
  8. 8.
    Chadha, R., Sistla, A.P., Viswanathan, M.: Probabilistic Büchi automata with non-extremal acceptance thresholds. In: International Conference on Verification, Model Checking and Abstract Interpretation, pp. 103–117 (2010)Google Scholar
  9. 9.
    Chadha, R., Sistla, A.P., Viswanathan, M.: Power of randomization in automata on infinite strings. Log. Methods Comput. Sci. 7(3), 1–22 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Chadha, R., Sistla, A.P., Viswanathan, M.: Emptiness under isolation and the value problem for hierarchical probabilistic automata (2017). https://www.cs.uic.edu/pub/Sistla/Publications/ValueProblem.pdf
  11. 11.
    Chadha, R., Sistla, A.P., Viswanathan, M., Ben, Y.: Decidable and expressive classes of probabilistic automata. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 200–214. Springer, Heidelberg (2015). doi: 10.1007/978-3-662-46678-0_13 CrossRefGoogle Scholar
  12. 12.
    Chadha, R., Sistla, A.P., Viswanathan, M.: Power of randomization in automata on infinite strings. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 229–243. Springer, Heidelberg (2009). doi: 10.1007/978-3-642-04081-8_16 CrossRefGoogle Scholar
  13. 13.
    Chadha, R., Sistla, A.P., Viswanathan, M.: Probabilistic automata with isolated cut-points. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 254–265. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-40313-2_24 CrossRefGoogle Scholar
  14. 14.
    Condon, A., Lipton, R.J.: On the complexity of space bounded interactive proofs (extended abstract). In: Symposium on Foundations of Computer Science, pp. 462–467 (1989)Google Scholar
  15. 15.
    Fijalkow, N., Gimbert, H., Oualhadj, Y.: Deciding the value 1 problem for probabilistic leaktight automata. In: IEEE Symposium on Logic in Computer Science, pp. 295–304 (2012)Google Scholar
  16. 16.
    Gimbert, H., Oualhadj, Y.: Probabilistic automata on finite words: Decidable and undecidable problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 527–538. Springer, Heidelberg (2010). doi: 10.1007/978-3-642-14162-1_44 CrossRefGoogle Scholar
  17. 17.
    Kemeny, J.G., Snell, J.L.: Denumerable Markov Chains. Springer, New York (1976)CrossRefzbMATHGoogle Scholar
  18. 18.
    Paz, A.: Introduction to Probabilistic Automata. Academic Press, Orlando (1971)zbMATHGoogle Scholar
  19. 19.
    Rabin, M.O.: Probabilistic automata. Inf. Control 6(3), 230–245 (1963)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Kwek, S., Mehlhorn, K.: Optimal search for rationals. Inf. Process. Lett. 86(1), 23–26 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: Symposium on Foundations of Computer Science, pp. 327–338 (1985)Google Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  • Rohit Chadha
    • 1
    Email author
  • A. Prasad Sistla
    • 2
  • Mahesh Viswanathan
    • 3
  1. 1.University of MissouriColumbiaUSA
  2. 2.University of IllinoisChicagoUSA
  3. 3.University of Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations