Skip to main content
SpringerLink
Log in

Games on Multi-stack Pushdown Systems

  • Conference paper
Book cover Logical Foundations of Computer Science (LFCS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5407))

Included in the following conference series:

Abstract

Bounded phase multi-stack pushdown automata have been studied recently. In this paper we show that parity games over bounded phase multi-stack pushdown systems are effectively solvable and winning strategy in these games can be effectively synthesized. We show some applications of our result, including a new proof of a known result that emptiness problem for bounded phase multi-stack automata is decidable.

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. Madhusudan, P., Parlato, G., La Torre, S.: A Robust Class of Context-Sensitive Languages. In: 22nd IEEE Symp. on Logic in Computer Science (LICS) Wroclaw, Poland (2007)

    Google Scholar 

  2. Madhusudan, P., Parlato, G., La Torre, S.: An Infinite Automaton Characterization of Double Exponential Time. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 33–48. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Madhusudan, P., Parlato, G., La Torre, S.: Context-Bounded Analysis of Concurrent Queue Systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 299–314. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Lal, A., Reps, T.: Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 37–51. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Proceedings of the 11th International Symposium on Tools and Algorithms for the Construction and Analysis of Systems (2005)

    Google Scholar 

  6. Kahlon, V., Ivancic, F., Gupta, A.: Reasoning About Threads Communicating via Locks. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 505–518. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Serre, O.: Note on Winning Positions on Pushdown Games with Omega-Regular Conditions. Information Processing Letters 85(6), 285–291 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cachat, T.: Uniform solution of parity games on prefix-recognizable graphs. In: Proc. INFINITY. ENTCS, vol. 68(6) (2002)

    Google Scholar 

  9. Walukiewicz, I.: Pushdown processes: games and model checking. Information and computation 164, 234–263 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Jurdziński, M.: Small Progress Measures for Solving Parity Games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290–301. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Applications to model checking. In: Proc. Concur, pp. 135–150 (1997)

    Google Scholar 

  12. Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. III, pp. 389–455. Springer, New York (1997)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engg., I.I.T. Kanpur, Kanpur, 208016, India

    Anil Seth

Authors
  1. Anil Seth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science, CUNY Graduate Center, 365 Fifth Avenue, NY 10016, New York, USA

    Sergei Artemov

  2. Department of Mathematics, Cornell University, 545 Malott Hall, NY 14853, Ithaca, USA

    Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seth, A. (2008). Games on Multi-stack Pushdown Systems. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2009. Lecture Notes in Computer Science, vol 5407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92687-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92687-0_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92686-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation