On Decision Problems for Probabilistic Büchi Automata
From MaRDI portal
Publication:5458366
Recommendations
- Probabilistic automata on infinite words: decidability and undecidability results
- Decidable problems for probabilistic automata on infinite words
- scientific article; zbMATH DE number 1822394
- Power of randomization in automata on infinite strings
- Probabilistic automata on finite words: decidable and undecidable problems
Cites work
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 729460 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 846904 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3240812 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- Automata, logics, and infinite games. A guide to current research
- Computer Aided Verification
- On the undecidability of probabilistic planning and related stochastic optimization problems
- Probabilistic automata
- Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
- Termination of Probabilistic Concurrent Program
- The complexity of probabilistic verification
- The complexity of two-player games of incomplete information
Cited in
(29)- scientific article; zbMATH DE number 3854424 (Why is no real title available?)
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
- A survey of partial-observation stochastic parity games
- Probabilistic Büchi automata with non-extremal acceptance thresholds
- Recurrence and transience for finite probabilistic tables
- Reachability analysis of quantum Markov decision processes
- Recurrence and transience for probabilistic automata
- Probabilistic automata on infinite words: decidability and undecidability results
- The Effect of Tossing Coins in Omega-Automata
- Perspective games
- Probabilistic Acceptors for Languages over Infinite Words
- Verification and control of partially observable probabilistic real-time systems
- CEGAR for compositional analysis of qualitative properties in Markov decision processes
- Ambiguity, weakness, and regularity in probabilistic Büchi automata
- scientific article; zbMATH DE number 1786649 (Why is no real title available?)
- Randomness for free
- Decidable problems for probabilistic automata on infinite words
- Verification and control of partially observable probabilistic systems
- Model checking linear-time properties of probabilistic systems
- scientific article; zbMATH DE number 1822394 (Why is no real title available?)
- Weighted versus Probabilistic Logics
- Model checking hyperproperties for Markov decision processes
- Probabilistic Weighted Automata
- When are emptiness and containment decidable for probabilistic automata?
- Decidable and expressive classes of probabilistic automata
- Partial-observation stochastic games, how to win when belief fails
- Power of randomization in automata on infinite strings
- Randomization in automata on infinite trees
- Power of Randomization in Automata on Infinite Strings
This page was built for publication: On Decision Problems for Probabilistic Büchi Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458366)