Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata

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 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}ω-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.

[1]  Christel Baier,et al.  Probabilistic ω-automata , 2012, JACM.

[2]  J. R. Büchi.  Symposium on Decision Problems: On a Decision Method in Restricted Second Order Arithmetic , 1966 .

[3]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

[4]  Helmut Seidl,et al.  On the Degree of Ambiguity of Finite Automata , 1986, MFCS.

[5]  Mahesh Viswanathan,et al.  Decidable and Expressive Classes of Probabilistic Automata , 2015, FoSSaCS.

[6]  Mahesh Viswanathan,et al.  Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata , 2017, FoSSaCS.

[7]  Bianca Truthe,et al.  Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009, Magdeburg, Germany, July 6-9, 2009 , 2009, DCFS.

[8]  Grégoire Sutre,et al.  On Flatness for 2-Dimensional Vector Addition Systems with States , 2004, CONCUR.

[9]  James Worrell,et al.  Probabilistic Automata of Bounded Ambiguity , 2020, CONCUR.

[10]  Mahesh Viswanathan,et al.  Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds , 2011, VMCAI.

[11]  Christel Baier,et al.  Principles of model checking , 2008 .

[12]  Roberto Amadio.  Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings , 2008, FoSSaCS.

[13]  Azaria Paz,et al.  Probabilistic automata , 2003 .

[14]  Hugo Gimbert,et al.  Probabilistic Automata on Finite Words: Decidable and Undecidable Problems , 2010, ICALP.

[15]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[16]  Alexander Moshe Rabinovich.  Complementation of Finitely Ambiguous Büchi Automata , 2018, DLT.

[17]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[18]  Mahesh Viswanathan,et al.  Power of Randomization in Automata on Infinite Strings , 2009, CONCUR.

[19]  Andrew M. Pitts,et al.  Foundations of Software Science and Computation Structures , 2015, Lecture Notes in Computer Science.

[20]  Christel Baier,et al.  Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability , 2009, DCFS.

[21]  Christel Baier,et al.  Recognizing /spl omega/-regular languages with probabilistic automata , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[22]  Lawrence H. Landweber,et al.  Decision problems forω-automata , 1969, Mathematical systems theory.

[23]  Pierre Wolper,et al.  An effective decision procedure for linear arithmetic over the integers and reals , 2005, TOCL.

[24]  Pierre Wolper,et al.  The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract) , 1985, ICALP.

[25]  George A. Miller,et al.  Finite State Languages , 1958, Inf. Control..

[26]  Ludwig Staiger,et al.  Finite-State omega-Languages , 1983, J. Comput. Syst. Sci..

[27]  Christof Löding,et al.  Alternating Automata and Logics over Infinite Words , 2000, IFIP TCS.

[28]  Jan Kretínský,et al.  Limit-Deterministic Büchi Automata for Linear Temporal Logic , 2016, CAV.

[29]  Christof Löding,et al.  On Finitely Ambiguous Büchi Automata , 2018, DLT.

[30]  Christel Baier,et al.  On Decision Problems for Probabilistic Büchi Automata , 2008, FoSSaCS.