The following pages link to (Q4501540):
Displaying 50 items.
- Solving parity games in big steps (Q340584) (← links)
- Alternating traps in Muller and parity games (Q389948) (← links)
- Optimal bounds in parametric LTL games (Q391106) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- Solving parity games by a reduction to SAT (Q414902) (← links)
- Synthesis of Reactive(1) designs (Q439954) (← links)
- Down the Borel hierarchy: solving Muller games via safety games (Q477197) (← links)
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
- Parametrized automata simulation and application to service composition (Q485834) (← links)
- Quantitative fair simulation games (Q528184) (← links)
- Faster algorithms for mean-payoff games (Q537946) (← links)
- Synthesis from component libraries with costs (Q683714) (← links)
- Verification of reactive systems via instantiation of parameterised Boolean equation systems (Q716322) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- Games with winning conditions of high Borel complexity (Q817850) (← links)
- Generic weakest precondition semantics from monads enriched with order (Q890376) (← links)
- The Rabin index of parity games: its complexity and approximation (Q897647) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- Strategy logic (Q979080) (← links)
- Model checking for hybrid logic (Q1047796) (← links)
- Looking at mean payoff through foggy windows (Q1629743) (← links)
- Parity game reductions (Q1656552) (← 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)
- Multi-buffer simulations: decidability and complexity (Q1784963) (← links)
- Memoryless determinacy of parity and mean payoff games: a simple proof (Q1884982) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- Model checking games for the quantitative \(\mu \)-calculus (Q1959394) (← links)
- Improving parity games in practice (Q2043434) (← links)
- Quasipolynomial computation of nested fixpoints (Q2044189) (← links)
- Bounded game-theoretic semantics for modal mu-calculus (Q2105468) (← links)
- Robust worst cases for parity games algorithms (Q2182730) (← links)
- Qualitative analysis of concurrent mean-payoff games (Q2346403) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Dicing on the Streett (Q2379984) (← links)
- Matching in security-by-contract for mobile code (Q2390033) (← links)
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- A superpolynomial lower bound for strategy iteration based on snare memorization (Q2446310) (← links)
- Concurrent reachability games (Q2465027) (← links)
- Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
- On modal \(\mu\)-calculus with explicit interpolants (Q2506827) (← links)
- The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
- A constructive algorithm for max-min paths problems on energy networks (Q2518634) (← links)
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
- Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- Two Variable vs. Linear Temporal Logic in Model Checking and Games (Q3090852) (← links)
- Recursive algorithm for parity games requires exponential time (Q3117548) (← links)
