Simplicity Lies in the Eye of the Beholder: A Strategic Perspective on Controllers in Reactive Synthesis
Not on the map. Why?
Abstract (arXiv)
In the game-theoretic approach to controller synthesis, we model the interaction between a system to be controlled and its environment as a game between these entities, and we seek an appropriate (e.g., winning or optimal) strategy for the system. This strategy then serves as a formal blueprint for a real-world controller. A common belief is that simple (e.g., using limited memory) strategies are better: corresponding controllers are easier to conceive and understand, and cheaper to produce and maintain. This invited contribution focuses on the complexity of strategies in a variety of synthesis contexts. We discuss recent results concerning memory and randomness, and take a brief look at what lies beyond our traditional notions of complexity for strategies.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 54 references that are in the map. First posted on arXiv 4 Sep 2025.
Builds on
27 of 54 references.
References · 27
- 2020Qualitative Controller Synthesis for Consumption Markov Decision Processescited by 9
- 2019Simple Strategies in Multi-Objective MDPs (Technical Report)cited by 7
- 2014Percentile Queries in Multi-Dimensional Markov Decision Processescited by 6
- 2018Strategy Representation by Decision Trees in Reactive Synthesiscited by 5
- 2013Looking at Mean-Payoff and Total-Payoff through Windowscited by 3
- 2014Variations on the Stochastic Shortest Path Problemcited by 3
- 2019Life is Random, Time is Not: Markov Decision Processes with Window Objectivescited by 3
- 2020Games Where You Can Play Optimally with Arena-Independent Finite Memorycited by 3
- 2021Arena-Independent Finite-Memory Determinacy in Stochastic Gamescited by 3
- 2022Different Strokes in Randomised Strategies: Revisiting Kuhn's Theorem under Finite-Memory Assumptionscited by 3
- 2023Games on Graphs: From Logic and Automata to Algorithmscited by 3
- 2013Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Gamescited by 2
15 more
- 2014Submixing and Shift-invariant Stochastic Gamescited by 2
- 2015Average-energy games (full version)cited by 2
- 2018Extending finite-memory determinacy by Boolean combination of winning conditionscited by 2
- 2019Energy mean-payoff gamescited by 2
- 2021Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphscited by 2
- 2022Characterising memory in infinite gamescited by 2
- 2025Mixing Any Cocktail with Limited Ingredients: On the Structure of Payoff Sets in Multi-Objective POMDPs and its Impact on Randomised Strategiescited by 2
- 2016Extending Finite Memory Determinacy to Multiplayer Gamescited by 1
- 2016Window Parity Games: An Alternative Approach Toward Parity Games with Time Boundscited by 1
- 2021Playing Stochastically in Weighted Timed Games to Emulate Memorycited by 1
- 2022Half-Positional Objectives Recognized by Deterministic B"uchi Automatacited by 1
- 2022How to Play Optimally for Regular Objectives?cited by 1
- 2024Positional ω-regular languagescited by 1
- 2024Programmatic Reinforcement Learning: Navigating Gridworldscited by 1
- 2025Taming Infinity one Chunk at a Time: Concisely Represented Strategies in One-Counter MDPscited by 1
Built on by
Not cited yet.