Skip to main content
SpringerLink
Log in

On Removing the Pushdown Stack in Reachability Constructions

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2223))

Included in the following conference series:

Abstract

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.

Supported in part by NSF grant IRI-9700370

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur and D. Dill. “The theory of timed automata,” TCS, 126(2):183–236, 1994

    Article  MathSciNet  MATH  Google Scholar 

  2. P. Abdulla and B. Jonsson. “Verifying programs with unreliable channels,” Information and Computation, 127(2): 91–101, 1996

    Article  MathSciNet  MATH  Google Scholar 

  3. A. Bouajjani, J. Esparza, and O. Maler. “Reachability analysis of pushdown automata: application to model-Checking,” CONCUR’97, LNCS 1243, pp. 135–150

    Google Scholar 

  4. G. Cece and A. Finkel. “Programs with Quasi-Stable Channels are Effectively Recognizable,” CAV’97, LNCS 1254, pp. 304–315 244

    Google Scholar 

  5. H. Comon and V. Cortier. “Flatness is not a weakness,” Proc. Computer Science Logic, 2000

    Google Scholar 

  6. H. Comon and Y. Jurski. “Multiple counters automata, safety analysis and Presburger arithmetic,” CAV’98, LNCS 1427, pp. 268–279

    Google Scholar 

  7. H. Comon and Y. Jurski. “Timed automata and the theory of real numbers,” CONCUR’99, LNCS 1664, pp. 242–257

    Google Scholar 

  8. Z. Dang. “Binary reachability analysis of timed pushdown automata with dense clocks,” CAV’01, LNCS 2102, pp. 506–517

    Google Scholar 

  9. Z. Dang and O. H. Ibarra. “Liveness verification of reversal-bounded counter machines with a free counter,” submitted, 2001

    Google Scholar 

  10. Z. Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer and J. Su. “Binary Reachability Analysis of Discrete Pushdown Timed Automata,” CAV’00, LNCS 1855, pp. 69–84

    Google Scholar 

  11. Z. Dang, P. San Pietro, and R. A. Kemmerer. “On Presburger Liveness of Discrete Timed Automata,” STACS’01, LNCS 2010, pp. 132–143

    Google Scholar 

  12. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. “Effcient Algorithms for Model Checking Pushdown Systems,” CAV’00, LNCS 1855, pp. 232–247

    Google Scholar 

  13. A. Finkel and G. Sutre. “Decidability of Reachability Problems for Classes of Two Counter Automata,” STACS’00, LNCS 1770, pp. 346–357 244

    Google Scholar 

  14. A. Finkel, B. Willems, and P. Wolper. “A direct symbolic approach to model checking pushdown systems,” INFINITY’97

    Google Scholar 

  15. S. Ginsburg and E. Spanier. “Bounded Algol-like languages,” Transactions of American Mathematical Society, 113, pp. 333–368, 1964.

    MathSciNet  MATH  Google Scholar 

  16. O. H. Ibarra. “Reversal-bounded multicounter machines and their decision problems,” J. ACM, 25 (1978) 116–133

    Article  MathSciNet  MATH  Google Scholar 

  17. O. H. Ibarra. “Reachability and safety in queue systems with counters and pushdown stack,” Proceedings of the International Conference on Implementation and Application of Automata, pp. 120–129, 2000.

    Google Scholar 

  18. O. H. Ibarra, T. Bultan, and J. Su. “Reachability analysis for some models of infinite-state transition systems,” CONCUR’00, pp. 183–198, 2000.

    Google Scholar 

  19. O. H. Ibarra. “Reachability and safety in queue systems with counters and pushdown stack,” Proceedings of the International Conference on Implementation and Application of Automata, pp. 120–129, 2000

    Google Scholar 

  20. O. H. Ibarra, Z. Dang, and P. San Pietro, “Verification in Loosely Synchronous Queue-Connected Discrete Timed Automata,” submitted. 2001

    Google Scholar 

  21. O. H. Ibarra and J. Su. “Generalizing the discrete timed automaton,” Proceedings of the International Conference on Implementation and Application of Automata, 206–215, 2000.

    Google Scholar 

  22. O. H. Ibarra, J. Su, T. Bultan, Z. Dang, and R. A. Kemmerer. “Counter Machines: Decidable Properties and Applications to Verification Problems,”, MFCS’00, LNCS 1893, pp. 426–435

    Google Scholar 

  23. K. L. McMillan. “Symbolic model-checking — an approach to the state explosion problem,” PhD thesis, Department of Computer Science, Carnegie Mellon University, 1992

    Google Scholar 

  24. W. Peng and S. Purushothaman. “Analysis of a Class of Communicating Finite State Machines,” Acta Informatica, 29(6/7): 499–522, 1992

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California Santa Barbara, 93106, CA, USA

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, 99164, Pullman, WA, USA

    Zhe Dang

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhe Dang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Basser Department of Computer Science, University of Sydney, Madsen Building F09, 2006, Sydney, NSW, Australia

    Peter Eades

  2. Department of Computer Science, University of Canterbury, Private Bag 4800, Christchurch, New Zealand

    Tadao Takaoka

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ibarra, O.H., Dang, Z. (2001). On Removing the Pushdown Stack in Reachability Constructions. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45678-3_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42985-2

  • Online ISBN: 978-3-540-45678-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation