Abstract
We study the problem of checking whether a two-player reachability game admits more than a winning strategy. We investigate this in case of perfect and imperfect information, and, by means of an automata approach we provide a linear-time procedure and an exponential-time procedure, respectively. In both cases, the results are tight.
| Original language | English |
|---|---|
| Pages (from-to) | 251-256 |
| Number of pages | 6 |
| Journal | CEUR Workshop Proceedings |
| Volume | 1720 |
| Publication status | Published - 1 Jan 2016 |
| Externally published | Yes |
| Event | 17th Italian Conference on Theoretical Computer Science, ICTCS 2016 - Lecce, Italy Duration: 7 Sept 2016 → 9 Sept 2016 |