The following pages link to Computer Science Logic (Q5292630):
Displaying 33 items.
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- The complexity of stochastic Müller games (Q418128) (← links)
- Qualitative reachability in stochastic BPA games (Q719240) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- Reduction of stochastic parity to stochastic mean-payoff games (Q963321) (← links)
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp (Q2233425) (← links)
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives (Q2248060) (← links)
- A survey of partial-observation stochastic parity games (Q2248075) (← links)
- Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Q2257302) (← links)
- Qualitative analysis of concurrent mean-payoff games (Q2346403) (← links)
- Dicing on the Streett (Q2379984) (← links)
- Concurrent reachability games (Q2465027) (← links)
- Qualitative Analysis of VASS-Induced MDPs (Q2811349) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Model Checking Probabilistic Systems (Q3176386) (← links)
- Strict Divergence for Probabilistic Timed Automata (Q3184704) (← links)
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
- Play to Test (Q3434603) (← links)
- Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (Q3448829) (← links)
- Decision Problems for Nash Equilibria in Stochastic Games (Q3644770) (← links)
- Simulation of Relay-Races (Q4692065) (← links)
- Model-Free Reinforcement Learning for Stochastic Parity Games (Q5089286) (← links)
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions (Q5090979) (← links)
- On Reachability Games of Ordinal Length (Q5448648) (← links)
- Stochastic Games with Lossy Channels (Q5458349) (← links)
- Stochastic Müller Games are PSPACE-Complete (Q5458855) (← links)
- Measuring and Synthesizing Systems in Probabilistic Environments (Q5501954) (← links)
- (Q5743484) (← links)
- Combinations of Qualitative Winning for Stochastic Parity Games (Q5875367) (← links)
- Symbolic control for stochastic systems via finite parity games (Q6122792) (← links)
- Robust almost-sure reachability in multi-environment MDPs (Q6535373) (← links)
- Fast symbolic algorithms for omega-regular games under strong transition fairness (Q6566589) (← links)
- Fair \(\omega \)-regular games (Q6629447) (← links)
