Concurrent reachability games
From MaRDI portal
Publication:2465027
DOI10.1016/j.tcs.2007.07.008zbMath1154.91306OpenAlexW1982429087MaRDI QIDQ2465027
Thomas A. Henzinger, Orna Kupferman, Luca de Alfaro
Publication date: 19 December 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.008
Related Items (36)
An Algorithm for Probabilistic Alternating Simulation ⋮ Simultaneously moving cops and robbers ⋮ Graph Games and Reactive Synthesis ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ Automatic verification of concurrent stochastic systems ⋮ A Dijkstra-type algorithm for dynamic games ⋮ Strategy improvement for concurrent reachability and turn-based stochastic safety games ⋮ A game-based abstraction-refinement framework for Markov decision processes ⋮ On the relation between reactive synthesis and supervisory control of non-terminating processes ⋮ Automated Verification of Concurrent Stochastic Games ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the determinacy of concurrent games on event structures with infinite winning sets ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes ⋮ The complexity of synchronizing Markov decision processes ⋮ Quantum games: a review of the history, current state, and interpretation ⋮ Distributed synthesis for regular and contextfree specifications ⋮ Selfish cops and passive robber: qualitative games ⋮ The complexity of solving reachability games using value and strategy iteration ⋮ Partial-Observation Stochastic Games ⋮ Stochastic game logic ⋮ Unnamed Item ⋮ Safe navigation in adversarial environments ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games ⋮ Reachability Games on Automatic Graphs ⋮ Unnamed Item ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Deciding Maxmin Reachability in Half-Blind Stochastic Games ⋮ Decoy allocation games on graphs with temporal logic objectives ⋮ The Complexity of Nash Equilibria in Limit-Average Games ⋮ Logical time control of concurrent DES ⋮ Robust shortest path planning and semicontractive dynamic programming ⋮ Complexity of node coverage games ⋮ Qualitative analysis of concurrent mean-payoff games ⋮ A turn-based approach for qualitative time concurrent games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strategy improvement for concurrent reachability and turn-based stochastic safety games
- The bad match; a total reward stochastic game
- Ordered field property for stochastic games when the player who controls transitions changes from state to state
- Dynamic noncooperative game theory
- Number of quantifiers is better than number of tape cells
- The complexity of stochastic games
- Symbolic model checking: \(10^{20}\) states and beyond
- Space-bounded reducibility among combinatorial problems
- The complexity of mean payoff games on graphs
- A finite algorithm for the switching control stochastic game
- Quantitative solution of omega-regular games
- Finite state Markovian decision processes
- An extension of Borel determinacy
- Alternating-time temporal logic
- A deterministic subexponential algorithm for solving parity games
- The complexity of quantitative concurrent parity games
- On the menbership problem for functional and multivalued dependencies in relational databases
- Existence of Value and Randomized Strategies in Zero-Sum Discrete-Time Stochastic Dynamic Games
- An Analysis of Stochastic Shortest Path Problems
- The determinacy of Blackwell games
- Stationary Strategies for Recursive Games
- On the synthesis of strategies in infinite games
- Termination of Probabilistic Concurrent Program
- Computer Science Logic
- Stochastic Games
- Recursive Concurrent Stochastic Games
This page was built for publication: Concurrent reachability games
