Hyper-Ackermannian bounds for pushdown vector addition systems

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).

[1]  Parosh Aziz Abdulla,et al.  Algorithmic Analysis of Programs with Well Quasi-ordered Domains , 2000, Inf. Comput..

[2]  Ranko Lazic.  The reachability problem for vector addition systems with a stack is not elementary , 2013, ArXiv.

[3]  Ahmed Bouajjani,et al.  Analysis of recursively parallel programs , 2012, POPL '12.

[4]  Philippe Schnoebelen,et al.  Multiply-Recursive Upper Bounds with Higman's Lemma , 2011, ICALP.

[5]  Albert R. Meyer,et al.  The Complexity of the Finite Containment Problem for Petri Nets , 1981, JACM.

[6]  Kenneth McAloon,et al.  Petri Nets and Large Finite Sets , 1984, Theor. Comput. Sci..

[7]  Philippe Schnoebelen,et al.  The Ordinal Recursive Complexity of Lossy Channel Systems , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[8]  Mizuhito Ogawa,et al.  Well-Structured Pushdown Systems , 2013, CONCUR.

[9]  Mahesh Viswanathan,et al.  Model Checking Multithreaded Programs with Asynchronous Atomic Methods , 2006, CAV.

[10]  Mahesh Viswanathan,et al.  Deciding branching time properties for asynchronous programs , 2009, Theor. Comput. Sci..

[11]  S. Wainer,et al.  Hierarchies of number-theoretic functions. I , 1970 .

[12]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[13]  Pierre McKenzie,et al.  A well-structured framework for analysing petri net extensions , 2004, Inf. Comput..

[14]  Parosh Aziz Abdulla,et al.  Push-Down Automata with Gap-Order Constraints , 2013, FSEN.

[15]  Philippe Schnoebelen,et al.  Reset Nets Between Decidability and Undecidability , 1998, ICALP.

[16]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[17]  Mohamed Faouzi Atig,et al.  Approximating Petri Net Reachability Along Context-free Traces , 2011, FSTTCS.

[18]  Stéphane Demri,et al.  The covering and boundedness problems for branching vector addition systems , 2013, J. Comput. Syst. Sci..

[19]  Klaus Reinhardt,et al.  Reachability in Petri Nets with Inhibitor Arcs , 2008, RP.

[20]  Philippe Schnoebelen,et al.  The Power of Priority Channel Systems , 2013, CONCUR.

[21]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[22]  R. Alur,et al.  Adding nesting structure to words , 2006, JACM.

[23]  Alain Finkel,et al.  Reduction and covering of infinite reachability trees , 1990, Inf. Comput..

[24]  Mahesh Viswanathan,et al.  Decidability Results for Well-Structured Transition Systems with Auxiliary Storage , 2007, CONCUR.

[25]  Rupak Majumdar,et al.  Algorithmic verification of asynchronous programs , 2010, TOPL.

[26]  Philippe Schnoebelen,et al.  The Power of Priority Channel Systems , 2013, CONCUR.

[27]  Philippe Schnoebelen,et al.  Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma , 2010, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.