Skip to main content
SpringerLink
Log in

Reachability in Succinct One-Counter Games

  • Conference paper
  • First Online:
Reachability Problems (RP 2015)

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

Included in the following conference series:

Abstract

We consider two-player games with reachability objectives played on transition systems of succinct one-counter machines, that is, machines where the counter is incremented or decremented by a value given in binary. We show that the winner-determination problem is EXPSPACE-complete regardless of whether transitions are guarded by constraints on the counter or if the counter is restricted to non-negative values.

This work was supported by the ERC inVEST (279499) project.

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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. Abdulla, P.A., Cerans, K.: Simulation is decidable for one-counter nets (extended abstract). In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 253–268. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Arul, A., Reichert, J.: The complexity of robot games on the integer line. In: QAPL, pp. 132–148 (2013)

    Google Scholar 

  3. Brázdil, T., Jančar, P., Kučera, A.: Reachability games on extended vector addition systems with states. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol. 6199, pp. 478–489. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource interfaces. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, pp. 117–133. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Demri, S., Gascon, R.: The effects of bounding syntactic resources on presburger LTL. In: TIME, pp. 94–104 (2007)

    Google Scholar 

  6. Demri, S., Lazić, R., Sangnier, A.: Model checking freeze LTL over one-counter automata. In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 490–504. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Fearnley, J., Jurdziński, M.: Reachability in two-clock timed automata Is PSPACE-complete. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 212–223. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  8. Göller, S., Haase, C., Ouaknine, J., Worrell, J.: Model checking succinct and parametric one-counter automata. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol. 6199, pp. 575–586. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Haase, C., Kreutzer, S., Ouaknine, J., Worrell, J.: Reachability in succinct and parametric one-counter automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 369–383. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Jančar, P., Kučera, A., Moller, F.: Simulation and bisimulation over one-counter processes. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 334–345. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Jurdzinski, M., Sproston, J., Laroussinie, F.: Model checking probabilistic timed automata with one or two clocks. Logical Methods in Computer Science 4(3) (2008)

    Google Scholar 

  12. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM 47(2), 312–360 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Reichert, J.: On the complexity of counter reachability games. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol. 8169, pp. 196–208. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  14. Serre, O.: Parity games played on transition graphs of one-counter processes. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 337–351. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’Informatique, Université Libre de Bruxelles (U.L.B.), Brussels, Belgium

    Paul Hunter

Authors
  1. Paul Hunter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paul Hunter .

Editor information

Editors and Affiliations

  1. The Institute of Informatics, University of Warsaw, Warsaw, Poland

    Mikolai Bojanczyk

  2. The Institute of Informatics, University of Warsaw, Warsaw, Poland

    Slawomir Lasota

  3. University of Liverpool, Liverpool, United Kingdom

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Hunter, P. (2015). Reachability in Succinct One-Counter Games. In: Bojanczyk, M., Lasota, S., Potapov, I. (eds) Reachability Problems. RP 2015. Lecture Notes in Computer Science(), vol 9328. Springer, Cham. https://doi.org/10.1007/978-3-319-24537-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24537-9_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24536-2

  • Online ISBN: 978-3-319-24537-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation