Well-Structured Pushdown Systems

Pushdown systems (PDSs) model single-thread recursive programs, and well-structured transition systems (WSTSs), such as vector addition systems, are useful to represent non-recursive multi-thread programs. Combining these two ideas, our goal is to investigate well-structured pushdown systems (WSPDSs), pushdown systems with well-quasi-ordered control states and stack alphabet. This paper focuses on subclasses of WSPDSs, in which the coverability becomes decidable. We apply WSTS-like techniques on classical P-automata. A Post*-automata (resp. Pre*-automata) construction is combined with Karp-Miller acceleration (resp. ideal representation) to characterize the set of successors (resp. predecessors) of given configurations. As examples, we show that the coverability is decidable for recursive vector addition system with states, multi-set pushdown systems, and a WSPDS with finite control states and well-quasi-ordered stack alphabet.

[1]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[2]  Mizuhito Ogawa,et al.  Well-Structured Pushdown Systems, Part 1:Decidable Classes for Coverability , 2013 .

[3]  Jean Goubault-Larrecq,et al.  Karp-Miller Trees for a Branching Extension of VASS , 2005, Discret. Math. Theor. Comput. Sci..

[4]  Mohamed Faouzi Atig,et al.  Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads , 2009, TACAS.

[5]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[6]  Jérôme Leroux,et al.  Vector addition system reachability problem: a short self-contained proof , 2011, POPL '11.

[7]  Jérôme Leroux.  Vector Addition System Reversible Reachability Problem , 2011, CONCUR.

[8]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

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

[10]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[11]  Richard Mayr,et al.  Process rewrite systems , 1999, EXPRESS.

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

[13]  Jean Goubault-Larrecq,et al.  Forward Analysis for WSTS, Part II: Complete WSTS , 2009, ICALP.

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

[15]  Pierre Wolper,et al.  A direct symbolic approach to model checking pushdown systems , 1997, INFINITY.

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

[17]  G. Ramalingam,et al.  Context-sensitive synchronization-sensitive analysis is undecidable , 2000, TOPL.

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

[19]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[20]  Jean Goubault-Larrecq,et al.  Forward analysis for WSTS, part I: completions , 2009, Mathematical Structures in Computer Science.

[21]  Andreas Weiermann,et al.  Complexity Bounds for Some Finite Forms of Kruskal's Theorem , 1994, J. Symb. Comput..

[22]  Javier Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.

[23]  Jakob Rehof,et al.  Context-Bounded Model Checking of Concurrent Software , 2005, TACAS.

[24]  Rupak Majumdar,et al.  Interprocedural analysis of asynchronous programs , 2007, POPL '07.

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

[26]  Antoni Mazurkiewicz,et al.  CONCUR '97: Concurrency Theory , 1997, Lecture Notes in Computer Science.

[27]  Alain Finkel,et al.  A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems , 1987, ICALP.

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