Reachability in succinct one-counter games
From MaRDI portal
Publication:1675146
DOI10.1007/978-3-319-24537-9_5zbMath1471.68165arXiv1407.1996OpenAlexW2271478894MaRDI QIDQ1675146
Publication date: 27 October 2017
Full work available at URL: https://arxiv.org/abs/1407.1996
Applications of game theory (91A80) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Countdown games, and simulation on (succinct) one-counter nets ⋮ Reachability games with relaxed energy constraints ⋮ On history-deterministic one-counter nets ⋮ Unnamed Item ⋮ Bounding Average-Energy Games ⋮ On decidability and complexity of low-dimensional robot games ⋮ Optimally Resilient Strategies in Pushdown Safety Games
This page was built for publication: Reachability in succinct one-counter games
