Document Open Access Logo

Deciding Polynomial Termination Complexity for VASS Programs

Authors Michal Ajdarów , Antonín Kučera

PDF

File

Thumbnail PDF
PDF
LIPIcs.CONCUR.2021.30.pdf
  • Filesize: 0.88 MB
  • 15 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Models of computation
Keywords
  • Termination complexity
  • vector addition systems

Metrics

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

Abstract

We show that for every fixed degree k ≥ 3, the problem whether the termination/counter complexity of a given demonic VASS is O(n^k), Ω(n^k), and Θ(n^k) is coNP-complete, NP-complete, and DP-complete, respectively. We also classify the complexity of these problems for k ≤ 2. This shows that the polynomial-time algorithm designed for strongly connected demonic VASS in previous works cannot be extended to the general case. Then, we prove that the same problems for VASS games are PSPACE-complete. Again, we classify the complexity also for k ≤ 2. Tractable subclasses of demonic VASS and VASS games are obtained by bounding certain structural parameters, which opens the way to applications in program analysis despite the presented lower complexity bounds.

Cite As Get BibTex

Michal Ajdarów and Antonín Kučera. Deciding Polynomial Termination Complexity for VASS Programs. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021) https://doi.org/10.4230/LIPIcs.CONCUR.2021.30

Author Details

Michal Ajdarów
  • Masaryk University, Brno, Czech Republic
Antonín Kučera
  • Masaryk University, Brno, Czech Republic

Funding

The work is supported by the Czech Science Foundation, Grant No. 21-24711S.

References

  1. M. Ajdarów and A. Kučera. Deciding polynomial termination complexity for VASS programs. arXiv, 2102.06889 [cs.LO], 2021. URL: http://arxiv.org/abs/2102.06889.
  2. E. Albert, P. Arenas, S. Genaim, M. Gómez-Zamalloa, G. Puebla, D. V. Ramírez-Deantes, G. Román-Díez, and D. Zanardini. Termination and cost analysis with COSTA and its user interfaces. ENTCS, 258(1):109-121, 2009. URL: https://doi.org/10.1016/j.entcs.2009.12.008.
  3. C. Alias, A. Darte, P. Feautrier, and L. Gonnord. Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs. In Proceedings of SAS 2010, volume 6337 of Lecture Notes in Computer Science, pages 117-133. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-15769-1_8.
  4. T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, and D. Velan. Deciding fast termination for probabilistic VASS with nondeterminism. In Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings, volume 11781 of Lecture Notes in Computer Science, pages 462-478. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-31784-3_27.
  5. T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, and F. Zuleger. Efficient algorithms for asymptotic bounds on termination time in VASS. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, pages 185-194. ACM, 2018. URL: https://doi.org/10.1145/3209108.3209191.
  6. M. Broy and M. Wirsing. On the algebraic specification of nondeterministic programming languages. In CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings, volume 112 of Lecture Notes in Computer Science, pages 162-179. Springer, 1981. URL: https://doi.org/10.1007/3-540-10828-9_61.
  7. Q. Carbonneaux, J. Hoffmann, T. W. Reps, and Z. Shao. Automated resource analysis with coq proof objects. In Proceedings of CAV 2017, volume 10427 of Lecture Notes in Computer Science, pages 64-85. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-63390-9_4.
  8. W. Czerwiński, S. Lasota, R. Lazić, J. Leroux, and F. Mazowiecki. The reachability problem for Petri nets is not elementary. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, pages 24-33. ACM, 2019. URL: https://doi.org/10.1145/3313276.3316369.
  9. A. F.-Montoya and R. Hähnle. Resource analysis of complex programs with cost equations. In Proceedings of APLAS 2014, volume 8858 of Lecture Notes in Computer Science, pages 275-295. Springer, 2014. URL: https://doi.org/10.1007/978-3-319-12736-1_15.
  10. J. Giesl, C. Aschermann, M. Brockschmidt, F. Emmes, F. Frohn, C. Fuhs, J. Hensel, C. Otto, M. Plücker, P. Schneider-Kamp, T. Ströder, S. Swiderski, and R. Thiemann. Analyzing program termination and complexity automatically with aprove. J. Autom. Reasoning, 58(1):3-31, 2017. URL: https://doi.org/10.1007/s10817-016-9388-y.
  11. S. Gulwani, K. K. Mehra, and T. M. Chilimbi. SPEED: precise and efficient static estimation of program computational complexity. In Proceedings of POPL 2009, pages 127-139. ACM, 2009. URL: https://doi.org/10.1145/1480881.1480898.
  12. J. Hoffmann, K. Aehlig, and M. Hofmann. Multivariate amortized resource analysis. ACM Trans. Program. Lang. Syst., 34(3):14:1-14:62, 2012. URL: https://doi.org/10.1145/2362389.2362393.
  13. A. Kučera, J. Leroux, and D. Velan. Efficient analysis of VASS termination complexity. In LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020, pages 676-688, 2020. URL: https://doi.org/10.1145/3373718.3394751.
  14. J. Leroux. Polynomial vector addition systems with states. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, volume 107 of LIPIcs, pages 134:1-134:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.ICALP.2018.134.
  15. R. Lipton. The reachability problem requires exponential space. Technical report 62, Yale, 1976. Google Scholar
  16. E.W. Mayr and A.R. Meyer. The complexity of the finite containment problem for Petri nets. J. ACM, 28(3):561-576, 1981. URL: https://doi.org/10.1145/322261.322271.
  17. Ch. Papadimitriou. Computational Complexity. Addison, 1994. Google Scholar
  18. M. Sinn, F. Zuleger, and H. Veith. A simple and scalable static analysis for bound analysis and amortized complexity analysis. In Proccedings of CAV 2014, volume 8559 of Lecture Notes in Computer Science, pages 745-761. Springer, 2014. URL: https://doi.org/10.1007/978-3-319-08867-9_50.
  19. M. Sinn, F. Zuleger, and H. Veith. Complexity and resource bound analysis of imperative programs using difference constraints. J. Autom. Reasoning, 59(1):3-45, 2017. URL: https://doi.org/10.1007/s10817-016-9402-4.
  20. F. Zuleger. The polynomial complexity of vector addition systems with states. In Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, volume 12077 of Lecture Notes in Computer Science, pages 622-641. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-45231-5_32.
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