Pages that link to "Item:Q4596605"
From MaRDI portal
The following pages link to On the synthesis of strategies in infinite games (Q4596605):
Displaying 50 items.
- Infinite games specified by 2-tape automata (Q324245) (← links)
- Automata-theoretic decision of timed games (Q386611) (← links)
- Connectivity games over dynamic networks (Q391110) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- Finding and fixing faults (Q414907) (← links)
- Synthesis of opaque systems with static and dynamic masks (Q453510) (← links)
- Achieving distributed control through model checking (Q453529) (← links)
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343) (← links)
- Infinite games with finite knowledge gaps (Q528188) (← links)
- Optimal paths in weighted timed automata (Q596026) (← links)
- Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
- Information tracking in games on graphs (Q616037) (← links)
- Constructive semantics for instantaneous reactions (Q631753) (← links)
- Exploring the boundary of half-positionality (Q656821) (← links)
- Quantitatively fair scheduling (Q764298) (← links)
- Games with winning conditions of high Borel complexity (Q817850) (← links)
- Safe learning for near-optimal scheduling (Q832074) (← links)
- Causality-based game solving (Q832242) (← links)
- Distributed synthesis for well-connected architectures (Q842581) (← links)
- Games with secure equilibria (Q854165) (← links)
- Synthesizing bounded-time 2-phase fault recovery (Q903518) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- Note on winning positions on pushdown games with \(\omega\)-regular conditions (Q1007544) (← links)
- On the design of correct and optimal dynamical systems and games (Q1028979) (← 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)
- Borel hierarchy and omega context free languages. (Q1401165) (← 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)
- Looking at mean payoff through foggy windows (Q1629743) (← links)
- Hierarchical information and the synthesis of distributed strategies (Q1629748) (← links)
- On equilibria in quantitative games with reachability/safety objectives (Q1678747) (← links)
- Automation of fault-tolerant graceful degradation (Q1733388) (← links)
- Pushdown processes: Games and model-checking (Q1854405) (← links)
- Quantitative solution of omega-regular games (Q1887716) (← links)
- Symbolic synthesis of masking fault-tolerant distributed programs (Q1938357) (← links)
- Strategy construction for parity games with imperfect information (Q1959483) (← links)
- Discrete-time control for rectangular hybrid automata (Q1960531) (← links)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
- Logical time control of concurrent DES (Q2058560) (← links)
- Synthesis in presence of dynamic links (Q2105465) (← links)
- A turn-based approach for qualitative time concurrent games (Q2117153) (← links)
- On the relation between reactive synthesis and supervisory control of non-terminating processes (Q2177781) (← links)
- Constrained existence of weak subgame perfect equilibria in multiplayer Büchi games (Q2203592) (← links)
- Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control (Q2231651) (← links)
- Compositional synthesis of finite abstractions for networks of systems: a small-gain approach (Q2280884) (← links)
- Reasoning about memoryless strategies under partial observability and unconditional fairness constraints (Q2346410) (← links)
- The complexity of automated addition of fault-tolerance without explicit legitimate states (Q2355327) (← links)
- Dicing on the Streett (Q2379984) (← links)
