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

被引：5
|
作者：
Chaloupka, Jakub [1 ]
机构：
[1] Masaryk Univ, Fac Informat, Brno 60200, Czech Republic
来源：
FUNDAMENTA INFORMATICAE | 2013年 / 123卷 / 01期
关键词：
BISIMILARITY;
D O I：
10.3233/FI-2013-798
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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 for k > 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.
引用
收藏
页码：15 / 42
页数：28
相关论文
共 50 条
  • [1] Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P
    Chaloupka, Jakub
    REACHABILITY PROBLEMS, 2010, 6227 : 104 - 119
  • [2] Reachability Games on Extended Vector Addition Systems with States
    Brazdil, Tomas
    Jancar, Petr
    Kucera, Antonin
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, 2010, 6199 : 478 - +
  • [3] The Reachability Problem for Two-Dimensional Vector Addition Systems with States
    Blondin, Michael
    Englert, Matthias
    Finkel, Alain
    Goeller, Stefan
    Haase, Christoph
    Lazic, Ranko
    Mckenzie, Pierre
    Totzke, Patrick
    JOURNAL OF THE ACM, 2021, 68 (05)
  • [4] On flatness for 2-dimensional vector addition systems with states
    Leroux, J
    Sutre, G
    CONCUR 2004 - CONCURRENCY THEORY, PROCEEDINGS, 2004, 3170 : 402 - 416
  • [5] ALGORITHM FOR REACHABILITY PROBLEM FOR VECTOR ADDITION SYSTEMS
    SACERDOTE, GS
    TENNEY, RL
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 23 (06): : A595 - A596
  • [6] THE COMPLEXITY OF REACHABILITY IN AFFINE VECTOR ADDITION SYSTEMS WITH STATES
    Blondin, Michael
    Raskin, Mikhail
    LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 17 (03) : 3:1 - 3:31
  • [7] The Complexity of Reachability in Affine Vector Addition Systems with States
    Blondin, Michael
    Raskin, Mikhail
    PROCEEDINGS OF THE 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020), 2020, : 224 - 236
  • [8] Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete
    Blondin, Michael
    Finkel, Alain
    Goeller, Stefan
    Haase, Christoph
    McKenzie, Pierre
    2015 30TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2015, : 32 - 43
  • [9] Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
    Englert, Matthias
    Lazic, Ranko
    Totzke, Patrick
    PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 477 - 484
  • [10] ON THE COMPLEXITY OF CONTAINMENT, EQUIVALENCE, AND REACHABILITY FOR FINITE AND TWO-DIMENSIONAL VECTOR ADDITION SYSTEMS WITH STATES
    HOWELL, RR
    HUYNH, DT
    ROSIER, LE
    YEN, HC
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 247 : 360 - 370
12345