Skip to main content
SpringerLink
Log in

Pushdown Games with Unboundedness and Regular Conditions

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

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

Abstract

We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning conditions are Boolean combinations of a Büchi condition and a new condition that we call unboundedness. An infinite play satisfies the unboundedness condition if there is no bound on the size of the stack during the play. We show that the problem of deciding a winner in such games is EXPTIME-complete.

This research has been partially supported by the European Community Research Training Network “Games and Automata for Synthesis and Validation” (GAMES)

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. Arnold, A., Vincent, A., Walukiewicz, I.: Games for synthesis of controllers with partial observation. Theoretical Computer Science 303(1), 7–34 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Applications to model checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135–150. Springer, Heidelberg (1997)

    Google Scholar 

  3. Bouquet, A., Serre, O., Walukiewicz, I.: Pushdown games with the unboundedness and regular conditions: full version with complete proofs, http://www.labri.fr/~igw/publications.html

  4. Cachat, T.: Symbolic strategy synthesis for games on pushdown graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 704–715. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Cachat, T.: Uniform solution of parity games on prefix-recognizable graphs. In: Kucera, A., Mayr, R. (eds.) Proceedings of the 4th International Workshop on Verification of Infinite-State Systems. Electronic Notes in Theoretical Computer Science, vol. 68, Elsevier Science Publishers, Amsterdam (2002)

    Google Scholar 

  6. Cachat, T., Duparc, J., Thomas, W.: Solving pushdown games with a sigma-3 winning condition. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 322–336. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Emerson, E., Jutla, C., Sistla, A.: On model-checking for the mu-calculus and its fragments. Theoretical Computer Science 258(1-2), 491–522 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Emerson, E.A., Jutla, C., Sistla, A.: On model-checking for fragments of μ-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, Springer, Heidelberg (1993)

    Google Scholar 

  9. Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: Proc. FOCS 1991, pp. 368–377 (1991)

    Google Scholar 

  10. Esparza, J., Podelski, A.: Efficient algorithms for pre star and post star on interprocedural parallel flow graphs. In: POPL 2000: Principles of Programming Languages (2000)

    Google Scholar 

  11. Kupferman, O., Vardi, M.: An automata-theoretic approach to reasoning about infinite-state systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 36–52. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Muller, D., Schupp, P.: The theory of ends, pushdown automata and secondorder logic. Theoretical Computer Science 37, 51–75 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  13. Muller, D., Schupp, P.: Alternating automata on infinite trees. Theoretical Computer Science 54, 267–276 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. Serre, O.: Note on winning positions on pushdown games with ω-regular conditions. Information Processing Letters 85, 285–291 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Thomas, W.: Automata on infinite objects. In: van Leeuven, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 133–192. Elsevier, Amsterdam (1990)

    Google Scholar 

  16. Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1–13. Springer, Heidelberg (1995)

    Google Scholar 

  17. Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, Springer, Heidelberg (1997)

    Google Scholar 

  18. Walukiewicz, I.: Pushdown processes: Games and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 62–74. Springer, Heidelberg (1996)

    Google Scholar 

  19. Walukiewicz, I.: Pushdown processes: Games and model checking. Information and Computation 164(2), 234–263 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  20. Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science 200, 135–183 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Université Bordeaux I, 351, cours de la Libération, 33405, Talence Cedex, France

    Alexis-Julien Bouquet & Igor Walukiewicz

  2. LIAFA, Université Paris VII, 2 Place Jussieu, Paris, France

    Oliver Serre

Authors
  1. Alexis-Julien Bouquet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oliver Serre
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Igor Walukiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tata Institute of Fundamental Research, India

    Paritosh K. Pandya

  2. Tata Institute of Fundamental Research, School of Technology and Computer Science, Mumbai, India

    Jaikumar Radhakrishnan

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouquet, AJ., Serre, O., Walukiewicz, I. (2003). Pushdown Games with Unboundedness and Regular Conditions. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24597-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20680-4

  • Online ISBN: 978-3-540-24597-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation