The following pages link to Probabilistic ω-automata (Q5395674):
Displaying 17 items.
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives (Q269509) (← links)
- Probabilistic opacity for Markov decision processes (Q458386) (← links)
- Enforcing almost-sure reachability in POMDPs (Q832296) (← links)
- Decidable and expressive classes of probabilistic automata (Q1740668) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- Gradient-descent for randomized controllers under partial observability (Q2152644) (← links)
- Ambiguity, weakness, and regularity in probabilistic Büchi automata (Q2200844) (← links)
- Qualitative analysis of concurrent mean-payoff games (Q2346403) (← links)
- Distributed Synthesis in Continuous Time (Q2811352) (← links)
- Randomization in Automata on Infinite Trees (Q2946733) (← links)
- Monadic Second Order Logic with Measure and Category Quantifiers (Q4637695) (← links)
- (Q5009427) (← links)
- (Q5009440) (← links)
- Task-Aware Verifiable RNN-Based Policies for Partially Observable Markov Decision Processes (Q5026215) (← links)
- (Q5028446) (← links)
- Finite-Memory Strategies in POMDPs with Long-Run Average Objectives (Q5076693) (← links)
- Measure Quantifier in Monadic Second Order Logic (Q5283434) (← links)
