Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00080250" target="_blank" >RIV/00216224:14330/13:00080250 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.3233/FI-2013-798" target="_blank" >http://dx.doi.org/10.3233/FI-2013-798</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3233/FI-2013-798" target="_blank" >10.3233/FI-2013-798</a>
Alternative languages
Result language
angličtina
Original language name
Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P
Original language description
We consider a two-player infinite game with zero-reachability objectives played on a 2-dimensional vector addition system with states (VASS), the states of which are divided between the two players. Brazdil, Jancar, and Kucera (2010) have shown that fork > 0, deciding the winner in a game on k-dimensional VASS is in (k - 1)-EXPTIME. In this paper, we show that, for k = 2, the problem is in P, and thus improve the EXPTIME upper bound.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Fundamenta Informaticae
ISSN
0169-2968
e-ISSN
—
Volume of the periodical
123
Issue of the periodical within the volume
1
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
28
Pages from-to
15-42
UT code for WoS article
000317267500003
EID of the result in the Scopus database
—