On Polynomial-Size Programs Winning Finite-State Games
No abstract available.
Related papers
- Localized Attractor Computations for Infinite-State Games CAV 2024
- Computing Adequately Permissive Assumptions for Synthesis TACAS 2023
- An Automaton Learning Approach to Solving Safety Games over Infinite Graphs TACAS 2016
- Guessing Winning Policies in LTL Synthesis by Semantic Learning CAV 2023
- Synthesizing Permissive Winning Strategy Templates for Parity Games CAV 2023
- Most General Winning Secure Equilibria Synthesis in Graph Games TACAS 2024
- Quasipolynomial Computation of Nested Fixpoints TACAS 2021
- Solving Infinite-State Games via Acceleration POPL 2024