Skip to main content
SpringerLink
Log in

Games on Higher Order Multi-stack Pushdown Systems

  • Conference paper
Reachability Problems (RP 2009)

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

Included in the following conference series:

Abstract

In this paper we define higher order multi-stack pushdown systems. We show that parity games over bounded phase higher order multi-stack pushdown systems are effectively solvable and winning strategy in these games can be effectively synthesized.

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. Seth, A.: Games on Higher Order Multi-Stack Pushdown Systems, full version, http://www.cse.iitk.ac.in/users/seth/RP09/fullversion

  2. Seth, A.: Games on Multi-Stack Pushdown Systems. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 395–408. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Carayol, A., Hague, M., Meyer, A., Ong, C.-H.L., Serre, O.: Winning Regions of Higher-Order Pushdown Games. In: Proc: LICS 2008, pp. 193–204. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  4. Hague, M., Murawski, A.S., Luke Ong, C.-H., Serre, O.: Collapsible Pushdown Automata and Recursion Schemes. In: Proc: LICS 2008, pp. 452–461. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  5. Madhusudan, P., Parlato, G., La Torre, S.: A Robust Class of Context-Sensitive Languages. In: Proc: LICS 2007, pp. 161–170. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  6. 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 

  7. Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93–107. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Knapik, T., Niwinski, D., Urzyczyn, P., Walukiewicz, I.: Unsafe Grammars and Panic Automata. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1450–1461. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Bouajjani, A., Meyer, A.: Symbolic reachability analysis of higher-order context-free processes. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 135–147. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Cachat, T.: Higher order pushdown automata, the caucal hierarchy of graphs and parity games. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 556–569. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. 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 

  14. 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 

  15. Engelfriet, J.: Iterated pushdown automata and complexity classes. In: STOC 1983: Proceedings of the fifteenth annual ACM symposium on Theory of computing, pp. 365–373. ACM Press, New York (1983)

    Chapter  Google Scholar 

  16. Damm, W., Goerdt, A.: An automata-theoretical characterization of the OI-hierarchy. Information and Control 71(1-2), 1–32 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Maslov, A.N.: Multilevel stack automata. Problems of Information Transmission 15, 1170–1174 (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and 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. Ecole Polytechnique, Laboratoire d’ Informatique (LIX), 91128, Palaiseau Cedex, France

    Olivier Bournez

  2. Department of Computer Science, Ashton Building, University of Liverpool, L69 3BX, Liverpool, England

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seth, A. (2009). Games on Higher Order Multi-stack Pushdown Systems. In: Bournez, O., Potapov, I. (eds) Reachability Problems. RP 2009. Lecture Notes in Computer Science, vol 5797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04420-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04420-5_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04419-9

  • Online ISBN: 978-3-642-04420-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation