Data Multi-Pushdown Automata

We extend the classical model of multi-pushdown systems by considering systems that operate on a finite set of variables ranging over natural numbers. The conditions on variables are defined via gap-order constraints that allow to compare variables for equality, or to check that the gap between the values of two variables exceeds a given natural number. Furthermore, each message inside a stack is equipped with a data item representing its value. When a message is pushed to the stack, its value may be defined by a variable. When a message is popped, its value may be copied to a variable. Thus, we obtain a system that is infinite in multiple dimensions, namely we have a number of stacks that may contain an unbounded number of messages each of which is equipped with a natural number. It is well-known that the verification of any non-trivial property of multi-pushdown systems is undecidable, even for two stacks and for a finite data-domain. In this paper, we show the decidability of the reachability problem for the classes of data multi-pushdown system that admit a bounded split-width (or equivalently a bounded tree-width). As an immediate consequence, we obtain decidability for several subclasses of data multi-pushdown systems. These include systems with single stacks, restricted ordering policies on stack operations, bounded scope, bounded phase, and bounded context switches.

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

[2]  Peter Z. Revesz,et al.  A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints , 1993, Theor. Comput. Sci..

[3]  Parosh Aziz Abdulla,et al.  The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems , 2012, LATA.

[4]  C. Aiswarya,et al.  Controllers for the Verification of Communicating Multi-pushdown Systems , 2014, CONCUR.

[5]  Thomas W. Reps,et al.  Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis , 2008, CAV.

[6]  C. Aiswarya,et al.  MSO Decidability of Multi-Pushdown Systems via Split-Width , 2012, CONCUR.

[7]  Karlis Cerans,et al.  Deciding Properties of Integral Relational Automata , 1994, ICALP.

[8]  Salvatore La Torre,et al.  Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width , 2012, FSTTCS.

[9]  Anca Muscholl,et al.  Reachability Analysis of Communicating Pushdown Systems , 2010, FoSSaCS.

[10]  Mohamed Faouzi Atig,et al.  Adjacent Ordered Multi-Pushdown Systems , 2014, Int. J. Found. Comput. Sci..

[11]  Parosh Aziz Abdulla,et al.  Budget-bounded model-checking pushdown systems , 2014, Formal Methods Syst. Des..

[12]  Paul Gastin,et al.  Analyzing Timed Systems Using Tree Automata , 2016, CONCUR.

[13]  Salvatore La Torre,et al.  Reducing Context-Bounded Concurrent Reachability to Sequential Reachability , 2009, CAV.

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

[15]  C. Aiswarya,et al.  Verifying Communicating Multi-pushdown Systems via Split-Width , 2014, ATVA.

[16]  Aiswarya Cyriac,et al.  Verification of communicating recursive programs via split-width , 2014 .

[17]  Mohamed Faouzi Atig,et al.  Acceleration in Multi-PushDown Systems , 2016, TACAS.

[18]  Salvatore La Torre,et al.  A Robust Class of Context-Sensitive Languages , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[19]  Margherita Napoli,et al.  Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations , 2011, CONCUR.

[20]  Lorenzo Clemente,et al.  Reachability Analysis of First-order Definable Pushdown Systems , 2015, CSL.

[21]  Benedikt Bollig,et al.  Emptiness of Multi-pushdown Automata Is 2ETIME-Complete , 2008, Developments in Language Theory.

[22]  Paul Gastin,et al.  Verification of Parameterized Communicating Automata via Split-Width , 2016, FoSSaCS.

[23]  Anil Seth.  Global Reachability in Bounded Phase Multi-stack Pushdown Systems , 2010, CAV.

[24]  Gennaro Parlato,et al.  The tree width of auxiliary storage , 2011, POPL '11.

[25]  Mohamed Faouzi Atig,et al.  Model-Checking of Ordered Multi-Pushdown Automata , 2012, Log. Methods Comput. Sci..

[26]  Mohamed Faouzi Atig,et al.  Global Model Checking of Ordered Multi-Pushdown Systems , 2010, FSTTCS.

[27]  P. Abdulla,et al.  On the Coverability Problem for Constrained Multiset Rewriting , 2008 .

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

[29]  Ahmed Bouajjani,et al.  On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures , 1994, Hybrid Systems.

[30]  Luca Breveglieri,et al.  Multi-Push-Down Languages and Grammars , 1996, Int. J. Found. Comput. Sci..

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

[32]  C. Aiswarya,et al.  Model Checking Languages of Data Words , 2012, FoSSaCS.

[33]  Frank S. de Boer,et al.  It is pointless to point in bounded heaps , 2015, Sci. Comput. Program..

[34]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.