Abstract
Probabilistic 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.
This work is supported by the German research council (DFG) Research Training Group 2236 UnRAVeL.
Chapter PDF
Similar content being viewed by others
References
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
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
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)
Baier, C., Größer, M., Bertrand, N.: Probabilistic \(\omega \)-automata. Journal of the ACM (JACM) 59(1), 1 (2012)
Baier, C., Katoen, J.: Principles of model checking. MIT Press (2008)
Boigelot, B., Jodogne, S., Wolper, P.: An effective decision procedure for linear arithmetic over the integers and reals. ACM Trans. Comput. Log. 6(3), 614–633 (2005), https://doi.org/10.1145/1071596.1071601
Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Studies in Logic and the Foundations of Mathematics, vol. 44, pp. 1–11. Elsevier (1966)
Chadha, R., Sistla, A.P., Viswanathan, M.: Power of randomization in automata on infinite strings. Logical Methods in Computer Science 7 (2011)
Chadha, R., Sistla, A.P., Viswanathan, M.: Probabilistic Büchi automata with non-extremal acceptance thresholds. In: International Workshop on Verification, Model Checking, and Abstract Interpretation. pp. 103–117. Springer (2011)
Chadha, R., Sistla, A.P., Viswanathan, M.: Emptiness under isolation and the value problem for hierarchical probabilistic automata. In: FOSSACS 2017. LNCS, vol. 10203, pp. 231–247 (2017), https://doi.org/10.1007/978-3-662-54458-7
Chadha, R., Sistla, A.P., Viswanathan, M., Ben, Y.: Decidable and expressive classes of probabilistic automata. In: FoSSaCS 2015. LNCS, vol. 9034, pp. 200–214. Springer (2015), https://doi.org/10.1007/978-3-662-46678-0
Fijalkow, N., Riveros, C., Worrell, J.: Probabilistic automata of bounded ambiguity. In: 28th International Conference on Concurrency Theory (CONCUR 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)
Gimbert, H., Oualhadj, Y.: Probabilistic automata on finite words: Decidable and undecidable problems. In: International Colloquium on Automata, Languages, and Programming. pp. 527–538. Springer (2010)
Landweber, L.H.: Decision problems for \(\omega \)-automata. Mathematical Systems Theory 3, 376–384 (1969)
Leroux, J., Sutre, G.: On flatness for 2-dimensional vector addition systems with states. In: International Conference on Concurrency Theory. pp. 402–416. Springer (2004)
Löding, C., Pirogov, A.: On finitely ambiguous Büchi automata. In: Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings. pp. 503–515 (2018)
Löding, C., Thomas, W.: Alternating automata and logics over infinite words. In: Proceedings of the IFIP International Conference on Theoretical Computer Science, IFIP TCS2000. LNCS, vol. 1872, pp. 521–535. Springer (2000)
Rabin, M.O.: Probabilistic automata. Information and control 6(3), 230–245 (1963)
Rabinovich, A.: Complementation of finitely ambiguous Büchi automata. In: Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings. pp. 541–552 (2018)
Sickert, S., Esparza, J., Jaax, S., Křetínský, J.: Limit-deterministic Büchi automata for linear temporal logic. In: Chaudhuri, S., Farzan, A. (eds.) Computer Aided Verification. pp. 312–332. Springer International Publishing, Cham (2016)
Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic (extended abstract). In: ICALP 1985. LNCS, vol. 194, pp. 465–474. Springer (1985), https://doi.org/10.1007/BFb0015725
Staiger, L.: Finite-state \(\omega \)-languages. Journal of Computer and System Sciences 27(3), 434–448 (1983)
Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, pp. 133–192. Elsevier Science Publishers, Amsterdam (1990)
Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language Theory, vol. III, pp. 389–455. Springer (1997)
Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. Theoretical Computer Science 88(2), 325–349 (1991)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2020 The Author(s)
About this paper
Cite this paper
Löding, C., Pirogov, A. (2020). Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. In: Goubault-Larrecq, J., König, B. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2020. Lecture Notes in Computer Science(), vol 12077. Springer, Cham. https://doi.org/10.1007/978-3-030-45231-5_27
Download citation
DOI: https://doi.org/10.1007/978-3-030-45231-5_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-45230-8
Online ISBN: 978-3-030-45231-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)