Reachability is Tower Complete
Logic in Computer Science
2020-03-24 v2
Abstract
A complete characterization of the complexity of the reachability problem for vector addition system has been open for a long time. The problem is shown to be Tower complete.
Cite
@article{arxiv.2003.06077,
title = {Reachability is Tower Complete},
author = {Yuxi Fu and Qizhe Yang},
journal= {arXiv preprint arXiv:2003.06077},
year = {2020}
}
Comments
We apply to with draw this paper because there is a fatal error. At the moment we do not know how correct the mistake
Related papers
View all related →
Logic in Computer Science · Computer Science
Vector Addition System Reversible Reachability Problem
Jérôme Leroux
2016-08-11
Formal Languages and Automata Theory · Computer Science
Reachability in Vector Addition Systems is Ackermann-complete
Wojciech Czerwiński, Łukasz Orlikowski
2022-10-27
Formal Languages and Automata Theory · Computer Science
Reachability in 3-VASS is in Tower
Qizhe Yang, Yuxi Fu
2023-08-22
Logic in Computer Science · Computer Science
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
Jérôme Leroux, Sylvain Schmitz
2019-08-20
Logic in Computer Science · Computer Science
Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free
Jérôme Leroux, Grégoire Sutre
2020-07-20
Formal Languages and Automata Theory · Computer Science
Reachability in 3-VASS is Elementary
Wojciech Czerwiński, Ismaël Jecker, Sławomir Lasota, Łukasz Orlikowski
2025-04-29
Formal Languages and Automata Theory · Computer Science
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase +1
2017-03-20
Logic in Computer Science · Computer Science
PVASS Reachability is Decidable
Roland Guttenberg, Eren Keskin, Roland Meyer
2026-02-19
Logic in Computer Science · Computer Science
On the Reachability Problem for Two-Dimensional Branching VASS
Clotilde Bizière, Thibault Hilaire, Jérôme Leroux, Grégoire Sutre
2025-07-01
Formal Languages and Automata Theory · Computer Science
Reachability in Continuous Pushdown VASS
A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2023-11-01
Formal Languages and Automata Theory · Computer Science
Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
Roland Guttenberg, Wojciech Czerwiński, Sławomir Lasota
2025-05-20
Formal Languages and Automata Theory · Computer Science
The reachability problem for vector addition systems with a stack is not elementary
Ranko Lazic
2013-10-08
Formal Languages and Automata Theory · Computer Science
On Boundedness Problems for Pushdown Vector Addition Systems
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
2015-07-28
Formal Languages and Automata Theory · Computer Science
Geometry of Reachability sets of Vector Addition Systems
Roland Guttenberg, Mikhail Raskin, Javier Esparza
2023-07-25
Computational Complexity · Computer Science
Reachability in Geometrically $d$-Dimensional VASS
Yuxi Fu, Yangluo Zheng, Qizhe Yang
2025-04-18
Formal Languages and Automata Theory · Computer Science
The Reachability Problem for Petri Nets is Not Elementary
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jerome Leroux +1
2019-04-12
Formal Languages and Automata Theory · Computer Science
Improving Reachability in Vector Addition Systems through Pumpability
Weijun Chen, Yuxi Fu, Yangluo Zheng
2026-04-28
Logic in Computer Science · Computer Science
Demystifying Reachability in Vector Addition Systems
Jérôme Leroux, Sylvain Schmitz
2015-08-11
Formal Languages and Automata Theory · Computer Science
Reachability in fixed dimension vector addition systems with states
Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux +1
2020-05-12
Formal Languages and Automata Theory · Computer Science
New Lower Bounds for Reachability in Vector Addition Systems
Wojciech Czerwiński, Ismaël Jecker, Sławomir Lasota, Jérôme Leroux +1
2023-11-14
Computer Science and Game Theory · Computer Science
Reachability Games on Extended Vector Addition Systems with States
Tomas Brazdil, Petr Jancar, Antonin Kucera
2010-02-15
Formal Languages and Automata Theory · Computer Science
The complexity of bidirected reachability in valence systems
Moses Ganardi, Rupak Majumdar, Georg Zetzsche
2022-06-28
Formal Languages and Automata Theory · Computer Science
Integer Vector Addition Systems with States
Christoph Haase, Simon Halfon
2014-10-01
Formal Languages and Automata Theory · Computer Science
Box-Reachability in Vector Addition Systems
Shaull Almagor, Itay Hasson, Michał Pilipczuk, Michael Zaslavski
2025-08-19
Logic in Computer Science · Computer Science
Monus semantics in vector addition systems with states
Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche
2023-09-14