Jérôme Leroux
ABSTRACT
This paper studies the boundedness and termination problems for vector addition systems equipped with one stack. We introduce an algorithm, inspired by the Karp & Miller algorithm, that solves both problems for the larger class of well-structured pushdown systems. We show that the worst-case running time of this algorithm is hyper-Ackermannian for pushdown vector addition systems. For the upper bound, we introduce the notion of bad nested words over a well-quasi-ordered set, and we provide a general scheme of induction for bounding their lengths. We derive from this scheme a hyper-Ackermannian upper bound for the length of bad nested words over vectors of natural numbers. For the lower bound, we exhibit a family of pushdown vector addition systems with finite but large reachability sets (hyper-Ackermannian).
- P. A. Abdulla, K. Čerāns, B. Jonsson, and Y.-K. Tsay. Algorithmic analysis of programs with well quasi-ordered domains. Inform. Comput., 160(1--2):109--127, 2000. Google Scholar
Digital Library
- P. A. Abdulla, M. F. Atig, G. Delzanno, and A. Podelski. Push-down automata with gap-order constraints. In Selec. FSEN'13, volume 8161 of LNCS, pages 199--216. Springer, 2013.Google Scholar
- R. Alur and P. Madhusudan. Adding nesting structure to words. J. ACM, 56(3):1--16, 2009. Google ScholarDigital Library
- M. F. Atig and P. Ganty. Approximating petri net reachability along context-free traces. In Proc. FSTTCS'11, volume 13 of LIPIcs, pages 152--163. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011.Google Scholar
- A. Bouajjani and M. Emmi. Analysis of recursively parallel programs. ACM Trans. Prog. Lang. Syst., 35(3):1--49, 2013. Google ScholarDigital Library
- X. Cai and M. Ogawa. Well-structured pushdown systems. In Proc. CONCUR'13, volume 8052 of LNCS, pages 121--136. Springer, 2013. Google ScholarDigital Library
- R. Chadha and M. Viswanathan. Decidability results for well-structured transition systems with auxiliary storage. In Proc. CONCUR'07, volume 4703 of LNCS, pages 136--150. Springer, 2007. Google ScholarDigital Library
- R. Chadha and M. Viswanathan. Deciding branching time properties for asynchronous programs. Theor. Comput. Sci., 410(42):4169--4179, 2009. Google ScholarDigital Library
- P. Chambart and Ph. Schnoebelen. The ordinal recursive complexity of lossy channel systems. In Proc. LICS'08, pages 205--216. IEEE, 2008. Google ScholarDigital Library
- S. Demri, M. Jurdziński, O. Lachish, and R. Lazić. The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci., 79(1):23--38, 2013. Google ScholarDigital Library
- N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Commun. ACM, 22(8):465--476, 1979. Google ScholarDigital Library
- C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset nets between decidability and undecidability. In Proc. ICALP'98, volume 1443 of LNCS, pages 103--115. Springer, 1998. Google ScholarDigital Library
- D. Figueira, S. Figueira, S. Schmitz, and Ph. Schnoebelen. Ackermannian and primitive-recursive bounds with Dickson's lemma. In Proc. LICS'11, pages 269--278. IEEE, 2011. Google ScholarDigital Library
- A. Finkel. Reduction and covering of infinite reachability trees. Inform. Comput., 89(2):144--179, 1990. Google ScholarDigital Library
- A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theor. Comput. Sci., 256(1--2):63--92, 2001. Google ScholarDigital Library
- A. Finkel, P. McKenzie, and C. Picaronny. A well-structured framework for analysing Petri net extensions. Inform. Comput., 195(1--2):1--29, 2004. Google ScholarDigital Library
- P. Ganty and R. Majumdar. Algorithmic verification of asynchronous programs. ACM Trans. Prog. Lang. Syst., 34(1):6:1--6:48, 2012. Google ScholarDigital Library
- C. Haase, S. Schmitz, and Ph. Schnoebelen. The power of priority channel systems. In Proc. CONCUR'13, volume 8052 of LNCS, pages 319--333. Springer, 2013. Google ScholarDigital Library
- R. Lazic. The reachability problem for vector addition systems with a stack is not elementary. CoRR, abs/1310.1767, 2013. Presented at RP'12.Google Scholar
- M. Löb and S. Wainer. Hierarchies of number-theoretic functions. I. Archiv für mathematische Logik und Grundlagenforschung, 13(1--2):39--51, 1970. http://dx.doi.org/10.1007/BF01967649.Google Scholar
- E. Mayr and A. Meyer. The complexity of the finite containment problem for petri nets. J. ACM, 28(3):561--576, 1981. Google ScholarDigital Library
- K. McAloon. Petri nets and large finite sets. Theor. Comput. Sci., 32(1--2):173--183, 1984.Google Scholar
- C. Rackoff. The covering and boundedness problems for vector addition systems. Theor. Comput. Sci., 6(2):223--231, 1978..Google ScholarCross Ref
- K. Reinhardt. Reachability in petri nets with inhibitor arcs. Electr. Notes Theor. Comput. Sci., 223:239--264, 2008. Google ScholarDigital Library
- S. Schmitz and Ph. Schnoebelen. Multiply-recursive upper bounds with Higman's lemma. In Proc. ICALP'11, volume 6756 of LNCS, pages 441--452. Springer, 2011. Google ScholarDigital Library
- K. Sen and M. Viswanathan. Model checking multithreaded programs with asynchronous atomic methods. In Proc. CAV'06, volume 4144 of LNCS, pages 300--314. Springer, 2006. Google ScholarDigital Library
Index Terms
- Hyper-Ackermannian bounds for pushdown vector addition systems
Recommendations
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata
Checking whether one formal language is included in another is important in many verification tasks. In this article, we provide solutions for checking the inclusion of languages given by visibly pushdown automata over both finite and infinite words. ...
Timed pushdown automata and branching vector addition systems
LICS '17: Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer ScienceWe prove that non-emptiness of timed register pushdown automata is decidable in doubly exponential time. This is a very expressive class of automata, whose transitions may involve state and top-of-stack clocks with unbounded differences. It strictly ...
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems
Timed-register pushdown automata constitute a very expressive class of automata, whose transitions may involve state, input, and top-of-stack timed registers with unbounded differences. They strictly subsume pushdown timed automata of Bouajjani et al., ...
Comments