par Hunter, Paul William 
Référence Lecture notes in computer science, 9328, page (37-49)
Publication Publié, 2015
Référence Lecture notes in computer science, 9328, page (37-49)
Publication Publié, 2015
Article révisé par les pairs
| Résumé : | We consider two-player games with reachability objectives played on transition systems of succinct one-counter machines, that is, machines where the counter is incremented or decremented by a value given in binary. We show that the winner-determination problem is EXPSPACE-complete regardless of whether transitions are guarded by constraints on the counter or if the counter is restricted to non-negative values. |
