On Decision Problems for Probabilistic Büchi Automata

DOI10.1007/978-3-540-78499-9_21zbMath1139.68030OpenAlexW1494426349MaRDI QIDQ5458366

Nathalie Bertrand, Marcus Größer, Christel Baier

Publication date: 11 April 2008

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35)

Related Items

What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives, Reachability analysis of quantum Markov decision processes, The Effect of Tossing Coins in Omega-Automata, Probabilistic Weighted Automata, Model Checking Linear-Time Properties of Probabilistic Systems, Verification and Control of Partially Observable Probabilistic Real-Time Systems, Randomization in Automata on Infinite Trees, Randomness for free, Verification and control of partially observable probabilistic systems, Recurrence and transience for finite probabilistic tables, Ambiguity, weakness, and regularity in probabilistic Büchi automata, Decidable and expressive classes of probabilistic automata, A survey of partial-observation stochastic parity games, Partial-Observation Stochastic Games, Probabilistic Acceptors for Languages over Infinite Words, Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds, CEGAR for compositional analysis of qualitative properties in Markov decision processes, Power of Randomization in Automata on Infinite Strings, Weighted versus Probabilistic Logics, Model checking hyperproperties for Markov decision processes

Uses Software

• POMDP

Cites Work

• The complexity of two-player games of incomplete information
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Automata, logics, and infinite games. A guide to current research
• Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
• The complexity of probabilistic verification
• Termination of Probabilistic Concurrent Program
• Computer Aided Verification
• Probabilistic automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item