Pages that link to "Item:Q1314640"

The following pages link to Infinite games played on finite graphs (Q1314640):

Displaying 50 items.

• Solving parity games in big steps (Q340584) (← links)
• Alternating traps in Muller and parity games (Q389948) (← links)
• A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
• Down the Borel hierarchy: solving Muller games via safety games (Q477197) (← links)
• Selfish cops and passive robber: qualitative games (Q529065) (← links)
• Information tracking in games on graphs (Q616037) (← links)
• Exploring the boundary of half-positionality (Q656821) (← links)
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
• Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
• Quantitatively fair scheduling (Q764298) (← links)
• On the positional determinacy of edge-labeled games (Q818128) (← links)
• Update games and update networks (Q876693) (← links)
• Randomness for free (Q897644) (← links)
• Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
• Deductive verification of alternating systems (Q939163) (← links)
• Note on winning positions on pushdown games with \(\omega\)-regular conditions (Q1007544) (← links)
• Infinite games on finitely coloured graphs with applications to automata on infinite trees (Q1276252) (← links)
• Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
• Finite automata on timed \(\omega\)-trees (Q1395427) (← links)
• Structural measures for games and process control in the branch learning model (Q1575709) (← links)
• Minimal separating sets for acceptance conditions in Muller automata (Q1575897) (← links)
• Monadic second-order logic on tree-like structures (Q1606130) (← links)
• Parity game reductions (Q1656552) (← links)
• Solving parity games via priority promotion (Q1742991) (← links)
• New deterministic algorithms for solving parity games (Q1756345) (← links)
• Energy parity games (Q1758152) (← links)
• Learning to win process-control games watching game-masters (Q1854518) (← links)
• Memoryless determinacy of parity and mean payoff games: a simple proof (Q1884982) (← links)
• Quantitative solution of omega-regular games (Q1887716) (← links)
• McNaughton games and extracting strategies for concurrent programs (Q1919769) (← links)
• Strategy construction for parity games with imperfect information (Q1959483) (← links)
• Improving parity games in practice (Q2043434) (← links)
• Decoy allocation games on graphs with temporal logic objectives (Q2056945) (← links)
• Infinite games on finite graphs using grossone (Q2156891) (← links)
• Finite-state strategies in delay games (Q2182729) (← links)
• Robust worst cases for parity games algorithms (Q2182730) (← links)
• Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control (Q2231651) (← links)
• A survey of partial-observation stochastic parity games (Q2248075) (← links)
• Modular strategies for recursive game graphs (Q2368953) (← links)
• Consistent Consequence for Boolean Equation Systems (Q2891375) (← links)
• PLAYING MULLER GAMES IN A HURRY (Q2909222) (← links)
• Parameterized Algorithms for Parity Games (Q2946404) (← links)
• Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
• The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
• Extracting Winning Strategies in Update Games (Q3091450) (← links)
• The mu-calculus and Model Checking (Q3176384) (← links)
• Graph Games and Reactive Synthesis (Q3176385) (← links)
• Synthesis for Structure Rewriting Systems (Q3182943) (← links)
• From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
• Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)