Concurrent reachability games

Luca de Alfaro*, Thomas A. Henzinger, Orna Kupferman

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

101 Scopus citations

Abstract

We consider concurrent two-player games with reachability objectives. In such games, at each round, player 1 and player 2 independently and simultaneously choose moves, and the two choices determine the next state of the game. The objective of player 1 is to reach a set of target states; the objective of player 2 is to prevent this. These are zero-sum games, and the reachability objective is one of the most basic objectives: determining the set of states from which player 1 can win the game is a fundamental problem in control theory and system verification. There are three types of winning states, according to the degree of certainty with which player 1 can reach the target. From type-1 states, player 1 has a deterministic strategy to always reach the target. From type-2 states, player 1 has a randomized strategy to reach the target with probability 1. From type-3 states, player 1 has for every real ε > 0 a randomized strategy to reach the target with probability greater than 1 - ε. We show that for finite state spaces, all three sets of winning states can be computed in polynomial time: type-1 states in linear time, and type-2 and type-3 states in quadratic time. The algorithms to compute the three sets of winning states also enable the construction of the winning and spoiling strategies.

Original languageAmerican English
Pages (from-to)188-217
Number of pages30
JournalTheoretical Computer Science
Volume386
Issue number3
DOIs
StatePublished - 1 Nov 2007

Bibliographical note

Funding Information:
We thank Rajeev Alur, Krishnendu Chatterjee, Jerzy Filar, Christos Papadimitriou, T.E.S. Raghavan, Valter Sorana, and Mihalis Yannakakis for helpful discussions and pointers to the literature. We thank the U.S. National Science Foundation and the Swiss National Science Foundation for supporting this research. We also thank the Army Research Office, the Defense Advanced Research Projects Agency, the Office of Naval Research, and the Semiconductor Research Corporation for supporting the original conference publication of this work.

Keywords

  • Concurrent games
  • Games
  • Reachability
  • Stochastic games

Fingerprint

Dive into the research topics of 'Concurrent reachability games'. Together they form a unique fingerprint.

Cite this