Skip to main content
SpringerLink
Log in

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension

  • Conference paper
  • First Online:
Automata, Languages, and Programming (ICALP 2015)

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

Included in the following conference series:

Abstract

Does the trace language of a given vector addition system (VAS) intersect with a given context-free language? This question lies at the heart of several verification questions involving recursive programs with integer parameters. In particular, it is equivalent to the coverability problem for VAS that operate on a pushdown stack. We show decidability in dimension one, based on an analysis of a new model called grammar-controlled vector addition systems.

This work was partially supported by ANR project ReacHard (ANR-11-BS02-001).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Atig, M.F., Ganty, P.: Approximating Petri net reachability along context-free traces. In: FSTTCS, pp. 152–163 (2011)

    Google Scholar 

  2. Blondin, M., Finkel, A., Göller, S., Haase, C., McKenzie, P.: Reachability in two-dimensional vector addition systems with states is PSPACE-complete. In: LICS (2015, to appear)

    Google Scholar 

  3. Bouajjani, A., Habermehl, P., Mayr, R.: Automatic verification of recursive procedures with one integer parameter. TCS 295, 85–106 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Courtois, J.-B., Schmitz, S.: Alternating vector addition systems with states. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 220–231. Springer, Heidelberg (2014)

    Google Scholar 

  5. Demri, S., Jurdzinski, M., Lachish, O., Lazic, R.: The covering and boundedness problems for branching vector addition systems. JCSS 79(1), 23–38 (2013)

    MATH  MathSciNet  Google Scholar 

  6. Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. ACM Trans. Progr. Lang. Syst. 34(1), 6:1–6:48 (2012)

    Article  Google Scholar 

  7. Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas and languages. Pacific J. Math. 16(2), 285–296 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC, pp. 267–281 (1982)

    Google Scholar 

  9. Lazic, R.: The reachability problem for vector addition systems with a stack is not elementary (2013). CoRR abs/1310.1767

    Google Scholar 

  10. Lazic, R., Schmitz, S.: Non-elementary complexities for branching VASS, MELL, and extensions. In: CSL/LICS (2014)

    Google Scholar 

  11. Leroux, J.: Vector addition system reachability problem: a short self-contained proof. In: POPL, pp. 307–316 (2011)

    Google Scholar 

  12. Leroux, J., Praveen, M., Sutre, G.: Hyper-ackermannian bounds for pushdown vector addition systems. In: CSL/LICS (2014)

    Google Scholar 

  13. Leroux, J., Sutre, G.: On flatness for 2-dimensional vector addition systems with states. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 402–416. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Leroux, J., Sutre, G., Totzke, P.: On the coverability problem for pushdown vector addition systems in one dimension. CoRR abs/1503.04018, April 2015. http://arxiv.org/abs/http://arxiv.org/abs/1503.04018

  15. Lipton, R.J.: The reachability problem requires exponential space. Tech. Rep. 63, Yale University, January 1976

    Google Scholar 

  16. Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: STOC, pp. 238–246 (1981)

    Google Scholar 

  17. Rackoff, C.: The covering and boundedness problems for vector addition systems. TCS 6(2), 223–231 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  18. Reinhardt, K.: Reachability in Petri nets with inhibitor arcs. ENTCS 223, 239–264 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Univ. Bordeaux & CNRS, UMR 5800, Talence, France

    Jérôme Leroux & Grégoire Sutre

  2. Department of Computer Science, University of Warwick, Coventry, UK

    Patrick Totzke

Authors
  1. Jérôme Leroux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grégoire Sutre
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patrick Totzke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Patrick Totzke .

Editor information

Editors and Affiliations

  1. Reykjavik University, Reykjavik, Iceland

    Magnús M. Halldórsson

  2. Kyoto University, Kyoto, Japan

    Kazuo Iwama

  3. The University of Tokyo, Tokyo, Japan

    Naoki Kobayashi

  4. Technische Universiteit Eindhoven, Eindhoven, The Netherlands

    Bettina Speckmann

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leroux, J., Sutre, G., Totzke, P. (2015). On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47666-6_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47666-6_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47665-9

  • Online ISBN: 978-3-662-47666-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation