Document Open Access Logo

Challenges of the Reachability Problem in Infinite-State Systems (Invited Paper)

Author Wojciech Czerwiński

PDF

File

Thumbnail PDF
PDF
LIPIcs.MFCS.2024.2.pdf
  • Filesize: 0.53 MB
  • 8 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Parallel computing models
Keywords
  • reachability problem
  • infinite-state systems
  • vector addition systems
  • pushdown

Metrics

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

Abstract

The reachability problem is a central problem for various infinite state systems like automata with pushdown, with different kinds of counters or combinations thereof. Despite its centrality and decades of research the community still lacks a lot of answers for fundamental and basic questions of that type. I briefly describe my personal viewpoint on the current state of art and emphasise interesting directions, which are worth investigating in my opinion. I also formulate several easy to formulate and understand challenges, which might be pretty hard to solve but at the same time illustrate fundamental lack of our understanding in the area.

Cite As Get BibTex

Wojciech Czerwiński. Challenges of the Reachability Problem in Infinite-State Systems (Invited Paper). In 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 306, pp. 2:1-2:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.MFCS.2024.2

Author Details

Wojciech Czerwiński
  • University of Warsaw, Poland

Funding

  • Czerwiński, Wojciech: Supported by the ERC grant INFSYS, agreement no. 950398.

References

  1. Mohamed Faouzi Atig and Pierre Ganty. Approximating Petri Net Reachability Along Context-free Traces. In Proceedings of FSTTCS 2011, volume 13 of LIPIcs, pages 152-163, 2011. Google Scholar
  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. Google Scholar
  3. Rémi Bonnet. The Reachability Problem for Vector Addition System with One Zero-Test. In Proceedings of MFCS 2011, volume 6907 of Lecture Notes in Computer Science, pages 145-157, 2011. Google Scholar
  4. Wojciech Czerwinski, Ismaël Jecker, Slawomir 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. Google Scholar
  5. 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, volume 171 of LIPIcs, pages 48:1-48:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. Google Scholar
  6. Wojciech Czerwiński and Łukasz Orlikowski. Reachability in Vector Addition Systems is Ackermann-complete. In Proceedings of FOCS 2021, pages 1229-1240. IEEE, 2021. Google Scholar
  7. Wojciech Czerwiński and Łukasz Orlikowski. Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes. In Proceedings of LICS 2022, pages 40:1-40:12. ACM, 2022. Google Scholar
  8. Andrei Draghici, Christoph Haase, and Andrew Ryzhikov. Reachability in Fixed VASS: Expressiveness and Lower Bounds. In Proceedings of FoSSaCS 2024, volume 14575 of Lecture Notes in Computer Science, pages 185-205, 2024. Google Scholar
  9. 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. ACM, 2016. Google Scholar
  10. 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. Google Scholar
  11. Roland Guttenberg. Flattability of Priority Vector Addition Systems. In Proceedings of ICALP 2024, volume 297 of LIPIcs, pages 141:1-141:20, 2024. Google Scholar
  12. Christoph Haase and Simon Halfon. Integer Vector Addition Systems with States. In Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings, volume 8762 of Lecture Notes in Computer Science, pages 112-124, 2014. Google Scholar
  13. 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. Springer Berlin Heidelberg, 2009. Google Scholar
  14. John E. Hopcroft and Jean-Jacques Pansiot. On the Reachability Problem for 5-Dimensional Vector Addition Systems. Theor. Comput. Sci., 8:135-159, 1979. Google Scholar
  15. 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. Google Scholar
  16. Jérôme Leroux and Grégoire Sutre. Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free. In Proceedings of CONCUR 2020, volume 171 of LIPIcs, pages 37:1-37:17, 2020. Google Scholar
  17. Jérôme Leroux. The Reachability Problem for Petri Nets is Not Primitive Recursive. In Proceedings of FOCS 2021, pages 1241-1252, 2022. Google Scholar
  18. Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem. In Proceedings of STOC 1981, pages 238-246, 1981. Google Scholar
  19. Marvin L. Minsky. Computation: finite and infinite machines. Prentice-Hall, Inc., USA, 1967. Google Scholar
  20. Klaus Reinhardt. Reachability in Petri Nets with Inhibitor Arcs. Electron. Notes Theor. Comput. Sci., 223:239-264, 2008. Google Scholar
  21. Sylvain Schmitz. Complexity Hierarchies beyond Elementary. ACM Trans. Comput. Theory, 8(1):3:1-3:36, 2016. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

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