On the synthesis of strategies in infinite games
From MaRDI portal
Publication:4596605
DOI10.1007/3-540-59042-0_57zbMath1379.68233OpenAlexW1481109946MaRDI QIDQ4596605
Publication date: 4 December 2017
Published in: STACS 95 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59042-0_57
Related Items (89)
Safe learning for near-optimal scheduling ⋮ Causality-based game solving ⋮ Looking at mean payoff through foggy windows ⋮ Hierarchical information and the synthesis of distributed strategies ⋮ Quantitative solution of omega-regular games ⋮ Permissive strategies: from parity games to safety games ⋮ Distributed synthesis for well-connected architectures ⋮ Graph Games and Reactive Synthesis ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ Multiplayer Cost Games with Simple Nash Equilibria ⋮ Dicing on the Streett ⋮ Admissible Strategies in Infinite Games over Graphs ⋮ Infinite games specified by 2-tape automata ⋮ Compositional Control Synthesis for Partially Observable Systems ⋮ Games with secure equilibria ⋮ Optimal strategy synthesis for request-response games ⋮ Deciding Parity Games in Quasi-polynomial Time ⋮ Observer-based control of block-triangular discrete time hybrid automata on a partial order ⋮ Optimal paths in weighted timed automata ⋮ On the relation between reactive synthesis and supervisory control of non-terminating processes ⋮ Choice functions and well-orderings over the infinite binary tree ⋮ On equilibria in quantitative games with reachability/safety objectives ⋮ Automata-theoretic decision of timed games ⋮ Connectivity games over dynamic networks ⋮ Fixed point characterization of infinite behavior of finite-state systems ⋮ Information tracking in games on graphs ⋮ Finite automata on timed \(\omega\)-trees ⋮ Memory Reduction for Strategies in Infinite Games ⋮ Symbolic synthesis of masking fault-tolerant distributed programs ⋮ Model checking and synthesis for branching multi-weighted logics ⋮ BOCoSy: Small but Powerful Symbolic Output-Feedback Control ⋮ Symbolic control for stochastic systems via finite parity games ⋮ Borel hierarchy and omega context free languages. ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Finding and fixing faults ⋮ Synthesizing bounded-time 2-phase fault recovery ⋮ Constructive semantics for instantaneous reactions ⋮ Constrained existence of weak subgame perfect equilibria in multiplayer Büchi games ⋮ Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism ⋮ Observation and distinction: representing information in infinite games ⋮ Unnamed Item ⋮ Synthesis of opaque systems with static and dynamic masks ⋮ Achieving distributed control through model checking ⋮ Strategy construction for parity games with imperfect information ⋮ Unnamed Item ⋮ Game-based Synthesis of Distributed Controllers for Sampled Switched Systems ⋮ Discrete-time control for rectangular hybrid automata ⋮ Strategy Construction for Parity Games with Imperfect Information ⋮ Exploring the boundary of half-positionality ⋮ Automation of fault-tolerant graceful degradation ⋮ Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control ⋮ Deductive verification of alternating systems ⋮ The word problem for visibly pushdown languages described by grammars ⋮ Concurrent reachability games ⋮ Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints ⋮ Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games ⋮ Model Checking Games ⋮ Infinite games with finite knowledge gaps ⋮ Interface synthesis and protocol conversion ⋮ Global Caching for Coalgebraic Description Logics ⋮ The Robot Routing Problem for Collecting Aggregate Stochastic Rewards ⋮ From Philosophical to Industrial Logics ⋮ Perspective games ⋮ Unnamed Item ⋮ ATL with Strategy Contexts and Bounded Memory ⋮ Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives ⋮ Compositional synthesis of finite abstractions for networks of systems: a small-gain approach ⋮ Topological properties of omega context-free languages ⋮ Optimizing Winning Strategies in Regular Infinite Games ⋮ On Reachability Games of Ordinal Length ⋮ Church’s Problem and a Tour through Automata Theory ⋮ From Monadic Logic to PSL ⋮ Solving μ-Calculus Parity Games by Symbolic Planning ⋮ Note on winning positions on pushdown games with \(\omega\)-regular conditions ⋮ Logical time control of concurrent DES ⋮ Infinite games on finitely coloured graphs with applications to automata on infinite trees ⋮ Decision Problems for Nash Equilibria in Stochastic Games ⋮ On the design of correct and optimal dynamical systems and games ⋮ Quantitatively fair scheduling ⋮ Dynamic Observers for the Synthesis of Opaque Systems ⋮ Structural measures for games and process control in the branch learning model ⋮ Minimal separating sets for acceptance conditions in Muller automata ⋮ Pushdown processes: Games and model-checking ⋮ Reasoning about memoryless strategies under partial observability and unconditional fairness constraints ⋮ Synthesis in presence of dynamic links ⋮ How Deterministic are Good-For-Games Automata? ⋮ The complexity of automated addition of fault-tolerance without explicit legitimate states ⋮ A turn-based approach for qualitative time concurrent games ⋮ Games with winning conditions of high Borel complexity
This page was built for publication: On the synthesis of strategies in infinite games
