On Removing the Pushdown Stack in Reachability Constructions

A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton can be accepted by a 2-tape pushdown acceptor with reversal-bounded counters. We improve this result by showing that the stack can be removed from the acceptor, i.e., the binary reachability can be accepted by a 2-tape finite-state acceptor with reversal-bounded counters.We also obtain similar results for more general machine models. Our characterizations can be used to verify certain properties concerning these machines that were not verifiable before using previous techniques. We are also able to formulate a subset of Presburger LTL that is decidable for satisfiability-checking with respect to these machines.

[1]  Zhe Dang,et al.  On Presburger Liveness of Discrete Timed Automata , 2001, STACS.

[2]  Alain Finkel,et al.  Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract) , 1997, CAV.

[3]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

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

[5]  Hubert Comon-Lundh,et al.  Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.

[6]  Oscar H. Ibarra,et al.  Binary Reachability Analysis of Discrete Pushdown Timed Automata , 2000, CAV.

[7]  Oscar H. Ibarra,et al.  Reachability Analysis for Some Models of Infinite-State Transition Systems , 2000, CONCUR.

[8]  Oscar H. Ibarra,et al.  Conter Machines: Decidable Properties and Applications to Verification Problems , 2000, MFCS.

[9]  Zhe Dang,et al.  Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks , 2001, CAV.

[10]  Hubert Comon-Lundh,et al.  Timed Automata and the Theory of Real Numbers , 1999, CONCUR.

[11]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[12]  Oscar H. Ibarra,et al.  Reachability and Safety in Queue Systems , 2000, CIAA.

[13]  Oscar H. Ibarra,et al.  Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter , 2001, FSTTCS.

[14]  Kenneth L. McMillan,et al.  Symbolic model checking: an approach to the state explosion problem , 1992 .

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

[16]  Véronique Cortier,et al.  Flatness Is Not a Weakness , 2000, CSL.

[17]  S. Ginsburg,et al.  BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[18]  Oscar H. Ibarra,et al.  Generalizing the Discrete Timed Automaton , 2000, CIAA.

[19]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[20]  Oscar H. Ibarra,et al.  Verification in loosely synchronous queue-connected discrete timed automata , 2003, Theor. Comput. Sci..

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

[22]  Parosh Aziz Abdulla,et al.  Verifying programs with unreliable channels , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[23]  Alain Finkel,et al.  Decidability of Reachability Problems for Classes of Two Counters Automata , 2000, STACS.

[24]  S. Ginsburg,et al.  Bounded -like languages , 1964 .

[25]  Rajeev Alur,et al.  The Theory of Timed Automata , 1991, REX Workshop.