Document Open Access Logo

On Affine Reachability Problems

Authors Stefan Jaax, Stefan Kiefer

PDF

File

Thumbnail PDF
PDF
LIPIcs.MFCS.2020.48.pdf
  • Filesize: 479 kB
  • 14 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation
Keywords
  • Counter Machines
  • Matrix Semigroups
  • Reachability

Metrics

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

Abstract

We analyze affine reachability problems in dimensions 1 and 2. We show that the reachability problem for 1-register machines over the integers with affine updates is PSPACE-hard, hence PSPACE-complete, strengthening a result by Finkel et al. that required polynomial updates. Building on recent results on two-dimensional integer matrices, we prove NP-completeness of the mortality problem for 2-dimensional integer matrices with determinants +1 and 0. Motivated by tight connections with 1-dimensional affine reachability problems without control states, we also study the complexity of a number of reachability problems in finitely generated semigroups of 2-dimensional upper-triangular integer matrices.

Cite As Get BibTex

Stefan Jaax and Stefan Kiefer. On Affine Reachability Problems. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 48:1-48:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020) https://doi.org/10.4230/LIPIcs.MFCS.2020.48

Author Details

Stefan Jaax
  • Technische Universität München, Germany
Stefan Kiefer
  • University of Oxford, UK

Funding

  • Jaax, Stefan: Supported by an ERC Advanced Grant (787367: PaVeS). This research was also funded in part by TUM IGSSE Grant 10.06 (PARSEC).
  • Kiefer, Stefan: Supported by a Royal Society University Research Fellowship.

References

  1. P.C. Bell, M. Hirvensalo, and I. Potapov. Mortality for 2times2 matrices is NP-hard. In Proceedings of MFCS, pages 148-159, 2012. Google Scholar
  2. P.C. Bell, M. Hirvensalo, and I. Potapov. The identity problem for matrix semigroups in SL₂(ℤ) is NP-complete. In Proceedings of SODA, pages 187-206, 2017. Google Scholar
  3. A.M. Ben-Amram. Mortality of iterated piecewise affine functions over the integers: Decidability and complexity. Computability, 4(1):19-56, 2015. Google Scholar
  4. Michael Blondin and Mikhail Raskin. The complexity of reachability in affine vector addition systems with states. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ’20, page 224–236, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3373718.3394741.
  5. I. Borosh and L.B. Treybig. Bounds on positive integral solutions of linear Diophantine equations. Proceedings of the American Mathematical Society, 55:299-304, 1976. Google Scholar
  6. O. Bournez and M. Branicky. The mortality problem for matrices of low dimensions. Theory of Computing Systems, 35(4):433-448, 2002. Google Scholar
  7. O. Bournez, O. Kurganskyy, and I. Potapov. Reachability problems for one-dimensional piecewise affine maps. International Journal of Foundations of Computer Science, 29(4):529-549, 2018. Google Scholar
  8. C. Choffrut and J. Karhumäki. Some decision problems on integer matrices. RAIRO - Theoretical Informatics and Applications, 39(1):125-131, 2005. Google Scholar
  9. V. Chonev, J. Ouaknine, and J. Worrell. On the complexity of the orbit problem. Journal of the ACM, 63(3):23:1-23:18, 2016. Google Scholar
  10. W. Czerwiński, S. Lasota, R. Lazić, J. Leroux, and F. Mazowiecki. The reachability problem for Petri nets is not elementary. In Proceedings of STOC, pages 24-33, 2019. Google Scholar
  11. John Fearnley and Marcin Jurdziński. Reachability in two-clock timed automata is PSPACE-complete. Information and Computation, 243:26-36, 2015. Google Scholar
  12. A. Finkel, S. Göller, and C. Haase. Reachability in register machines with polynomial updates. In Proceedings of MFCS, pages 409-420, 2013. Google Scholar
  13. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York, NY, USA, 1979. Google Scholar
  14. Y. Gurevich and P. Schupp. Membership problem for the modular group. SIAM Journal on Computing, 37(2):425-459, 2007. Google Scholar
  15. C. Haase and S. Halfon. Integer vector addition systems with states. In Reachability Problems, pages 112-124, 2014. Google Scholar
  16. R. Kannan and R.J. Lipton. The orbit problem is decidable. In Proceedings of STOC, pages 252-261, 1980. Google Scholar
  17. O. Kurganskyy, I. Potapov, and F. Sancho Caparrini. Reachability problems in low-dimensional iterative maps. International Journal of Foundations of Computer Science, 19(4):935-951, 2008. Google Scholar
  18. M.L. Minsky. Recursive unsolvability of Post’s problem of "tag" and other topics in theory of Turing machines. Annals of Mathematics, 74(3):437-455, 1961. Google Scholar
  19. T. Neary. Undecidability in binary tag systems and the Post correspondence problem for five pairs of words. In Proceedings of STACS, pages 649-661, 2015. Google Scholar
  20. R. Niskanen. Reachability problem for polynomial iteration is PSPACE-complete. In Proceedings of RP, pages 132-143, 2017. Google Scholar
  21. C. Nuccio and E. Rodaro. Mortality problem for 2times2 integer matrices. In Proceedings of SOFSEM, pages 400-405. Springer, 2008. Google Scholar
  22. J. Ouaknine and J. Worrell. Decision problems for linear recurrence sequences. In Reachability Problems, pages 21-28, 2012. Google Scholar
  23. M.S. Paterson. Unsolvability in 3 × 3 matrices. Studies in Applied Mathematics, 49(1):105-107, 1970. Google Scholar
  24. I. Potapov and P. Semukhin. Vector reachability problem in SL(2, ℤ). In Proceedings of MFCS, volume 58 of LIPIcs, pages 84:1-84:14, 2016. Google Scholar
  25. I. Potapov and P. Semukhin. Decidability of the membership problem for 2 times 2 integer matrices. In Proceedings of SODA, pages 170-186, 2017. Google Scholar
  26. J. Reichert. Reachability Games with Counters: Decidability and Algorithms. PhD thesis, ENS Cachan, 2015. Google Scholar
  27. A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, 1986. Google Scholar
  28. J. von zur Gathen and M. Sieveking. A bound on solutions of linear integer equalities and inequalities. Proceedings of the American Mathematical Society, 72:155-158, 1978. 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