Undecidability results for probabilistic automata

The model of probabilistic automata was introduced by Rabin in 1963. Ever since, undecidability results were obtained for this model, showing that although simple, it is very expressive. This paper provides streamlined constructions implying the most important negative results, including the celebrated inapproximability result of Condon and Lipton.

[1]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[2]  Olivier Serre,et al.  Randomization in Automata on Infinite Trees , 2014, TOCL.

[3]  Christel Baier,et al.  Stochastic Timed Automata , 2014, Log. Methods Comput. Sci..

[4]  Wen-Guey Tzeng,et al.  A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata , 1992, SIAM J. Comput..

[5]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[6]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[7]  Krishnendu Chatterjee,et al.  Decidable Problems for Probabilistic Automata on Infinite Words , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[8]  Nathanaël Fijalkow.  Characterisation of an Algebraic Algorithm for Probabilistic Automata , 2016, STACS.

[9]  Richard J. Lipton,et al.  On the complexity of space bounded interactive proofs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[10]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..

[11]  Giancarlo Mauri,et al.  Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata , 1977, ICALP.

[12]  Mahesh Viswanathan,et al.  Probabilistic Automata with Isolated Cut-Points , 2013, MFCS.

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

[14]  Javier Esparza,et al.  Analyzing probabilistic pushdown automata , 2013, Formal Methods Syst. Des..

[15]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

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

[17]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

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

[19]  Nathanaël Fijalkow.  Profinite techniques for probabilistic automata and the Markov Monoid algorithm , 2017, Theor. Comput. Sci..

[20]  Tomás Brázdil,et al.  Branching-Time Model-Checking of Probabilistic Pushdown Automata , 2009, INFINITY.

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

[22]  Joël Ouaknine,et al.  On the Complexity of Equivalence and Minimisation for Q-weighted Automata , 2013, Log. Methods Comput. Sci..

[23]  Alberto Bertoni,et al.  The Solution of Problems Relative to Probabilistic Automata in the Frame of the Formal Languages Theory , 1974, GI Jahrestagung.

[24]  Joël Ouaknine,et al.  Language Equivalence for Probabilistic Automata , 2011, CAV.

[25]  Hugo Gimbert,et al.  Deciding the Value 1 Problem for Probabilistic Leaktight Automata , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

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

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