Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete

被引：10
|
作者：
Englert, Matthias [1 ]
Lazic, Ranko [1 ]
Totzke, Patrick [1 ]
机构：
[1] Univ Warwick, Dept Comp Sci, DIMAP, Coventry, W Midlands, England
来源：
PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016) | 2016年
基金：
英国工程与自然科学研究理事会;
关键词：
ONE-COUNTER AUTOMATA;
D O I：
10.1145/2933575.2933577
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Blondin et al. showed at LICS 2015 that two-dimensional vector addition systems with states have reachability witnesses of length exponential in the number of states and polynomial in the norm of vectors. The resulting guess-and-verify algorithm is optimal (PSPACE), but only if the input vectors are given in binary. We answer positively the main question left open by their work, namely establish that reachability witnesses of pseudo-polynomial length always exist. Hence, when the input vectors are given in unary, the improved guess-and-verify algorithm requires only logarithmic space.
引用
收藏
页码：477 / 484
页数：8
相关论文
共 50 条
  • [1] 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
  • [2] 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)
  • [3] 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
  • [4] Reachability in Vector Addition Systems is Ackermann-complete
    Czerwinski, Wojciech
    Orlikowski, Lukasz
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 1229 - 1240
  • [5] Reachability Games on Extended Vector Addition Systems with States
    Brazdil, Tomas
    Jancar, Petr
    Kucera, Antonin
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, 2010, 6199 : 478 - +
  • [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] Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
    Blondin, Michael
    Haase, Christoph
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,
  • [9] Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P
    Chaloupka, Jakub
    FUNDAMENTA INFORMATICAE, 2013, 123 (01) : 15 - 42
  • [10] Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P
    Chaloupka, Jakub
    REACHABILITY PROBLEMS, 2010, 6227 : 104 - 119
12345