The following pages link to Concurrent reachability games (Q2465027):
Displaying 44 items.
- Expected reachability-time games (Q278757) (← links)
- Simultaneously moving cops and robbers (Q306253) (← links)
- A Dijkstra-type algorithm for dynamic games (Q338209) (← links)
- Strategy improvement for concurrent reachability and turn-based stochastic safety games (Q355506) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- Selfish cops and passive robber: qualitative games (Q529065) (← links)
- A game-based abstraction-refinement framework for Markov decision processes (Q600979) (← links)
- Stochastic game logic (Q715046) (← links)
- Safe navigation in adversarial environments (Q723641) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- Quantum games: a review of the history, current state, and interpretation (Q1994770) (← links)
- Decoy allocation games on graphs with temporal logic objectives (Q2056945) (← links)
- Logical time control of concurrent DES (Q2058560) (← links)
- A turn-based approach for qualitative time concurrent games (Q2117153) (← links)
- Automatic verification of concurrent stochastic systems (Q2147696) (← links)
- On the relation between reactive synthesis and supervisory control of non-terminating processes (Q2177781) (← links)
- Distributed synthesis for regular and contextfree specifications (Q2249664) (← links)
- The complexity of solving reachability games using value and strategy iteration (Q2254503) (← links)
- Complexity of node coverage games (Q2344734) (← links)
- Qualitative analysis of concurrent mean-payoff games (Q2346403) (← links)
- On the determinacy of concurrent games on event structures with infinite winning sets (Q2453582) (← links)
- Recursive Markov decision processes and recursive stochastic games (Q2796398) (← links)
- Deciding Maxmin Reachability in Half-Blind Stochastic Games (Q2819447) (← links)
- Relay reachability algorithm for exploring huge state space (Q2852022) (← links)
- An Algorithm for Probabilistic Alternating Simulation (Q2891387) (← links)
- Reachability Games on Automatic Graphs (Q3073641) (← links)
- The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
- Robust shortest path planning and semicontractive dynamic programming (Q3120605) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Reachability Switching Games (Q5002810) (← links)
- (Q5013876) (← links)
- (Q5091277) (← links)
- Strategy complexity of concurrent safety games (Q5111270) (← links)
- Partial-Observation Stochastic Games (Q5169972) (← links)
- Synchronous linear constraint system games (Q5859115) (← links)
- On the Complexity of Reachability in Parametric Markov Decision Processes (Q5875375) (← links)
- Automated Verification of Concurrent Stochastic Games (Q6104811) (← links)
- Equilibria-based probabilistic model checking for concurrent stochastic games (Q6535956) (← links)
- A cop and robber game on edge-periodic temporal graphs (Q6564615) (← links)
- Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions (Q6647764) (← links)
- Stochastic games with synchronizing objectives (Q6649478) (← links)
- Extended bounded response LTL: a new safety fragment for efficient reactive synthesis (Q6661746) (← links)
