Document Open Access Logo

Reachability in 3-VASS Is Elementary

Authors Wojciech Czerwiński , Ismaël Jecker , Sławomir Lasota , Łukasz Orlikowski

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.153.pdf
  • Filesize: 1 MB
  • 20 pages
HTML5 Logo HTML (experimental)
LIPIcs.ICALP.2025.153.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Parallel computing models
Keywords
  • vector addition systems
  • Petri nets
  • reachability problem
  • dimension three
  • doubly exponential space
  • length of shortest path

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The reachability problem in 3-dimensional vector addition systems with states (3-VASS) is known to be PSpace-hard, and to belong to Tower. We significantly narrow down the complexity gap by proving the problem to be solvable in doubly-exponential space. The result follows from a new upper bound on the length of the shortest path: if there is a path between two configurations of a 3-VASS then there is also one of at most triply-exponential length. We show it by introducing a novel technique of approximating the reachability sets of 2-VASS by small semi-linear sets.

Cite As Get BibTex

Wojciech Czerwiński, Ismaël Jecker, Sławomir Lasota, and Łukasz Orlikowski. Reachability in 3-VASS Is Elementary. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 153:1-153:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.153

Author Details

Wojciech Czerwiński
  • University of Warsaw, Poland
Ismaël Jecker
  • Université Marie et Louis Pasteur, CNRS, institut FEMTO-ST, F-25000 Besançon, France
Sławomir Lasota
  • University of Warsaw, Poland
Łukasz Orlikowski
  • University of Warsaw, Poland

Funding

  • Czerwiński, Wojciech: Supported by the ERC grant INFSYS, agreement no. 950398.
  • Lasota, Sławomir: Supported by the ERC grant INFSYS, agreement no. 950398 and by the NCN grant 2021/41/B/ST6/00535.
  • Orlikowski, Łukasz: Supported by the ERC grant INFSYS, agreement no. 950398.

Acknowledgements

We thank Radosław Piórkowski for many inspiring discussions about cones in VASS a few years ago and Filip Mazowiecki for the discussions about the reachability problem for #1-ǎss 3. We thank also Henry Sinclair-Banks for helpful discussions about [Dmitry Chistikov et al., 2024]. We thank Qizhe Yang and Yangluo Zheng for the discussions on 3-VASS, which are geometrically 2-dimensional. Finally, we thank anonymous reviewers for helpful comments.

References

  1. Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, and Patrick Totzke. The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM, 68(5):34:1-34:43, 2021. URL: https://doi.org/10.1145/3464794.
  2. Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, and Pierre McKenzie. Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. In Proceedings of LICS 2015, pages 32-43. IEEE Computer Society, 2015. URL: https://doi.org/10.1109/LICS.2015.14.
  3. Dmitry Chistikov, Wojciech Czerwiński, Piotr Hofman, Michal Pilipczuk, and Michael Wehar. Shortest paths in one-counter systems. Log. Methods Comput. Sci., 15(1), 2019. URL: https://doi.org/10.23638/LMCS-15(1:19)2019.
  4. Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, and Karol Wegrzycki. The tractability border of reachability in simple vector addition systems with states. In Proceedings of FOCS 2024, pages 1332-1354. IEEE, 2024. URL: https://doi.org/10.1109/FOCS61266.2024.00086.
  5. Dmitry Chistikov and Christoph Haase. The Taming of the Semi-Linear Set. In Proceedings of ICALP 2016, volume 55 of LIPIcs, pages 128:1-128:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. URL: https://doi.org/10.4230/LIPICS.ICALP.2016.128.
  6. Wojciech Czerwiński, Ismaël Jecker, Sławomir Lasota, Jérôme Leroux, and Lukasz Orlikowski. New Lower Bounds for Reachability in Vector Addition Systems. In Proceedings of FSTTCS 2023, volume 284 of LIPIcs, pages 35:1-35:22, 2023. URL: https://doi.org/10.4230/LIPICS.FSTTCS.2023.35.
  7. Wojciech Czerwiński, Sławomir Lasota, Ranko Lazic, Jérôme Leroux, and Filip Mazowiecki. Reachability in fixed dimension vector addition systems with states. In Proceedings of CONCUR 2020, pages 48:1-48:21, 2020. Google Scholar
  8. Wojciech Czerwiński, Sławomir Lasota, Ranko Lazic, Jérôme Leroux, and Filip Mazowiecki. The Reachability Problem for Petri Nets Is Not Elementary. J. ACM, 68(1):7:1-7:28, 2021. URL: https://doi.org/10.1145/3422822.
  9. Wojciech Czerwiński and Lukasz Orlikowski. Reachability in Vector Addition Systems is Ackermann-complete. In Proceedings of FOCS 2021, pages 1229-1240. IEEE, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00120.
  10. Matthias Englert, Ranko Lazic, and Patrick Totzke. Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. In Proceedings of LICS 2016, pages 477-484, 2016. URL: https://doi.org/10.1145/2933575.2933577.
  11. Yuxi Fu, Qizhe Yang, and Yangluo Zheng. Improved Algorithm for Reachability in d-VASS. In Proceedings of ICALP 2024, volume 297 of LIPIcs, pages 136:1-136:18, 2024. URL: https://doi.org/10.4230/LIPICS.ICALP.2024.136.
  12. Christoph Haase, Stephan Kreutzer, Joël Ouaknine, and James Worrell. Reachability in Succinct and Parametric One-Counter Automata. In Proceedings of CONCUR 2009, pages 369-383, 2009. URL: https://doi.org/10.1007/978-3-642-04081-8_25.
  13. John E. Hopcroft and Jean-Jacques Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci., 8:135-159, 1979. URL: https://doi.org/10.1016/0304-3975(79)90041-0.
  14. Rodney R. Howell, Louis E. Rosier, Dung T. Huynh, and Hsu-Chun Yen. Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States. Theor. Comput. Sci., 46(3):107-140, 1986. URL: https://doi.org/10.1016/0304-3975(86)90026-5.
  15. S. Rao Kosaraju. Decidability of reachability in vector addition systems (preliminary version). In Proceedings of STOC 1982, pages 267-281, 1982. URL: https://doi.org/10.1145/800070.802201.
  16. Jean-Luc Lambert. A structure to decide reachability in Petri nets. Theor. Comput. Sci., 99(1):79-104, 1992. URL: https://doi.org/10.1016/0304-3975(92)90173-D.
  17. Jérôme Leroux. The Reachability Problem for Petri Nets is Not Primitive Recursive. In Proceedings of FOCS 2021, pages 1241-1252. IEEE, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00121.
  18. Jérôme Leroux and Sylvain Schmitz. Demystifying Reachability in Vector Addition Systems. In Proceedings of LICS 2015, pages 56-67. IEEE Computer Society, 2015. URL: https://doi.org/10.1109/LICS.2015.16.
  19. Jérôme Leroux and Sylvain Schmitz. Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. In Proceedings of LICS 2019, pages 1-13. IEEE, 2019. URL: https://doi.org/10.1109/LICS.2019.8785796.
  20. Jérôme Leroux and Grégoire Sutre. On Flatness for 2-Dimensional Vector Addition Systems with States. In Proceedings of CONCUR 2004, volume 3170 of Lecture Notes in Computer Science, pages 402-416, 2004. URL: https://doi.org/10.1007/978-3-540-28644-8_26.
  21. Richard J. Lipton. The reachability problem requires exponential space. Technical report, Yale University, 1976. Google Scholar
  22. Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem. In Proceedings of STOC 1981, pages 238-246, 1981. URL: https://doi.org/10.1145/800076.802477.
  23. Loïc Pottier. Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms. In Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, volume 488 of Lecture Notes in Computer Science, pages 162-173. Springer, 1991. URL: https://doi.org/10.1007/3-540-53904-2_94.
  24. Charles Rackoff. The covering and boundedness problems for vector addition systems. Theor. Comput. Sci., 6:223-231, 1978. URL: https://doi.org/10.1016/0304-3975(78)90036-1.
  25. Sylvain Schmitz. Complexity hierarchies beyond elementary. ACM Trans. Comput. Theory, 8(1):3:1-3:36, 2016. URL: https://doi.org/10.1145/2858784.
  26. Alexander Schrijver. Theory of linear and integer programming. Wiley-Interscience series in discrete mathematics and optimization. Wiley, 1999. Google Scholar
  27. Yangluo Zheng. Reachability in vector addition system with states parameterized by geometric dimension, 2024. URL: https://doi.org/10.48550/arXiv.2412.14608.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact