Decidable Problems for Probabilistic Automata on Infinite Words
From MaRDI portal
Publication:2986795
DOI10.1109/LICS.2012.29zbMath1360.68546arXiv1107.2091OpenAlexW2079852549MaRDI QIDQ2986795
Mathieu Tracol, Krishnendu Chatterjee
Publication date: 16 May 2017
Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.2091
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (9)
A zero-one law for Markov chains ⋮ Decidable and expressive classes of probabilistic automata ⋮ Profinite techniques for probabilistic automata and the Markov monoid algorithm ⋮ Partial-Observation Stochastic Games ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Deciding Maxmin Reachability in Half-Blind Stochastic Games ⋮ Probabilistic automata of bounded ambiguity ⋮ Probabilistic Automata of Bounded Ambiguity ⋮ Qualitative analysis of concurrent mean-payoff games
This page was built for publication: Decidable Problems for Probabilistic Automata on Infinite Words
