The following pages link to Solving Parity Games in Big Steps (Q5458856):
Displaying 39 items.
- Solving parity games in big steps (Q340584) (← links)
- Alternating traps in Muller and parity games (Q389948) (← links)
- Verification of reactive systems via instantiation of parameterised Boolean equation systems (Q716322) (← links)
- Parity game reductions (Q1656552) (← links)
- Model-checking iterated games (Q1674862) (← links)
- Latticed-LTL synthesis in the presence of noisy inputs (Q1677194) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)
- New deterministic algorithms for solving parity games (Q1756345) (← links)
- A delayed promotion policy for parity games (Q1784960) (← links)
- Improving parity games in practice (Q2043434) (← links)
- Robust worst cases for parity games algorithms (Q2182730) (← links)
- Parameterized linear temporal logics meet costs: still not costlier than LTL (Q2413483) (← links)
- A superpolynomial lower bound for strategy iteration based on snare memorization (Q2446310) (← links)
- Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes (Q3000666) (← links)
- The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
- Recursive algorithm for parity games requires exponential time (Q3117548) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Cooking Your Own Parity Game Preorders Through Matching Plays (Q3177339) (← links)
- From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
- Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis (Q3297602) (← links)
- (Q3384167) (← links)
- Symmetric Strategy Improvement (Q3449491) (← links)
- Solving μ-Calculus Parity Games by Symbolic Planning (Q3614877) (← links)
- Solving Parity Games in Practice (Q3648698) (← links)
- Deciding the unguarded modal -calculus (Q4583323) (← links)
- (Q5009456) (← links)
- (Q5013884) (← links)
- (Q5013885) (← links)
- (Q5015267) (← links)
- (Q5015274) (← links)
- (Q5015286) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- A Multi-Core Solver for Parity Games (Q5415659) (← links)
- A Decision Procedure for CTL* Based on Tableaux and Automata (Q5747771) (← links)
- How Much Lookahead is Needed to Win Infinite Games? (Q5892380) (← links)
- How Much Lookahead is Needed to Win Infinite Games? (Q5899477) (← links)
