Skip to main content
SpringerLink
Log in

Model Checking CTL Properties of Pushdown Systems

  • Conference paper
  • First Online:
FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000)

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

Abstract

A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula ? ∈ L decide if ? holds in the vertex of G(P) which is the initial configuration of P. Computation Tree Logic (CTL) and its fragment EF are considered. The model checking problems for CTL and EF are shown to be EXPTIME-complete and PSPACE-complete, respectively.

The author was supported by Polish KBN grant No. 8 T11C 027 16.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Applications to model checking. In CONCUR’97, volume 1243 of LNCS, pages 135–150, 1997.

    Google Scholar 

  2. D. Caucal. On infinite transition graphs a having decidable monadic theory. In ICALP’96, LNCS, 1996.

    Google Scholar 

  3. A. K. Chandra, D. C.& Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114–133, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  4. E. Clarke and E. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop on Logics of Programs, volume 131 of LNCS, pages 52–71. Springer-Verlag, 1981.

    Google Scholar 

  5. E. A. Emerson. Temporal and modal logic. In J. Leeuven, editor, Handbook of Theoretical Computer Science Vol.B, pages 995–1072. Elsevier, 1990.

    Google Scholar 

  6. J. Esparza. Private communication.

    Google Scholar 

  7. J. Esparza, D. Hansel, and P. Rossmanith. efficient algorithms for model checking pushdown systems. In CAV’ 00, LNCS, 2000. to appear.

    Google Scholar 

  8. D. Muller and P. Schupp. The theory of ends,tipushdown automata and second-order logic. Theoretical Computer Science, 37:51–75, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  9. I. Walukiewicz. Pushdown processes: Games and model checking. InCAV’96, volume 1102 of LNCS, pages 62–74, 1996. To appear in Information and Computation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, Banacha 2, 02-097, Warsaw, POLAND

    Igor Walukiewicz

Authors
  1. Igor Walukiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Delhi, Hauz Khas, 110016, New Delhi, India

    Sanjiv Kapoor  & Sanjiva Prasad  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walukiewicz, I. (2000). Model Checking CTL Properties of Pushdown Systems. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-44450-5_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41413-1

  • Online ISBN: 978-3-540-44450-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation