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%2F10%3A00044604" target="_blank" >RIV/00216224:14330/10:00044604 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/10:00065878
Result on the web
—
DOI - Digital Object Identifier
—
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. Brázdil, Jančar, and Kučera (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
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
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
Article name in the collection
Reachability Problems
ISBN
978-3-642-15348-8
ISSN
—
e-ISSN
—
Number of pages
16
Pages from-to
—
Publisher name
Springer Berlin / Heidelberg
Place of publication
Berlin
Event location
Brno
Event date
Jan 1, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000283104200007