Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P

DOI10.3233/FI-2013-798zbMath1281.68160OpenAlexW2154312990MaRDI QIDQ4914309

J. Chaloupka

Publication date: 18 April 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2013-798

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time ⋮ On decidability and complexity of low-dimensional robot games

This page was built for publication: Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P