Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Continuous Pushdown VASS in One Dimension are Easy (2402.13237v1)

Published 20 Feb 2024 in cs.LO and cs.FL

Abstract: A pushdown vector addition system with states (PVASS) extends the model of vector addition systems with a pushdown stack. The algorithmic analysis of PVASS has applications such as static analysis of recursive programs manipulating integer variables. Unfortunately, reachability analysis, even for one-dimensional PVASS is not known to be decidable. We relax the model of one-dimensional PVASS to make the counter updates continuous and show that in this case reachability, coverability, and boundedness are decidable in polynomial time. In addition, for the extension of the model with lower-bound guards on the states, we show that coverability and reachability are in NP, and boundedness is in coNP.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (16)
  1. Reachability in Continuous Pushdown VASS. CoRR abs/2310.16798 (2023). https://doi.org/10.48550/ARXIV.2310.16798 arXiv:2310.16798
  2. Continuous One-Counter Automata. ACM Trans. Comput. Logic 24, 1, Article 3 (jan 2023), 31 pages. https://doi.org/10.1145/3558549
  3. Dmitry Chistikov and Rupak Majumdar. 2014. Unary Pushdown Automata and Straight-Line Programs. In Automata, Languages, and Programming, Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 146–157.
  4. The Reachability Problem for Petri Nets Is Not Elementary. J. ACM 68, 1 (2021), 7:1–7:28. https://doi.org/10.1145/3422822
  5. A lower bound for the coverability problem in acyclic pushdown VAS. Inform. Process. Lett. 167 (2021), 106079.
  6. Yuval Filmus. 2011. Hardness of finding a word of length at most k accepted by a nondeterministic pushdown automaton. https://cstheory.stackexchange.com/questions/4429/hardness-of-finding-a-word-of-length-at-most-k-accepted-by-a-nondeterministic.
  7. Reachability in Bidirected Pushdown VASS. In 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France (LIPIcs, Vol. 229), Mikolaj Bojanczyk, Emanuela Merelli, and David P. Woodruff (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 124:1–124:20. https://doi.org/10.4230/LIPIcs.ICALP.2022.124
  8. Christoph Haase. 2018. A survival guide to presburger arithmetic. ACM SIGLOG News 5, 3 (2018), 67–82.
  9. Matthew Hague and Anthony Widjaja Lin. 2011. Model Checking Recursive Programs with Numeric Data Types. In Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings (Lecture Notes in Computer Science, Vol. 6806), Ganesh Gopalakrishnan and Shaz Qadeer (Eds.). Springer, 743–759. https://doi.org/10.1007/978-3-642-22110-1_60
  10. Matthew Hague and Anthony Widjaja Lin. 2012. Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters. In CAV (Lecture Notes in Computer Science, Vol. 7358). Springer, 260–276.
  11. John E. Hopcroft and Jeff D. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company.
  12. Dexter C. Kozen. 1997. Automata and Computability (1st ed.). Springer-Verlag, Berlin, Heidelberg.
  13. Hyper-Ackermannian bounds for pushdown vector addition systems. In Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS ’14, Vienna, Austria, July 14 - 18, 2014, Thomas A. Henzinger and Dale Miller (Eds.). ACM, 63:1–63:10. https://doi.org/10.1145/2603088.2603146
  14. Jérôme Leroux and Sylvain Schmitz. 2019. Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019. IEEE, 1–13. https://doi.org/10.1109/LICS.2019.8785796
  15. On the coverability problem for pushdown vector addition systems in one dimension. In International Colloquium on Automata, Languages, and Programming. Springer, 324–336.
  16. On the Complexity of Equational Horn Clauses. In CADE (Lecture Notes in Computer Science, Vol. 3632). Springer, 337–352.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now