Skip to main content
SpringerLink
Log in

Hardness Results for Coverability Problem of Well-Structured Pushdown Systems

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2017)

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

  • 829 Accesses

Abstract

Well-Structured Pushdown Systems (WSPDSs) are pushdown systems extended with states and stack alphabet to be vectors, for modeling (restricted) recursive concurrent programs. It has been considered to be “very close to the border of undecidability”. In this paper, we prove some hardness results for the coverability problem of WSPDSs. We show that for WSPDS with three dimensional vectors as states and WSPDS with three dimensional vectors as stack alphabet, the coverability problem becomes Ackermann-hard.

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 EPUB and 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

References

  1. Abdulla, P.A., Čerāns, K., Jonsson, B., Tsay, Y.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1), 109–127 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Autebert, J., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 111–174. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  3. Bouajjani, A., Emmi, M.: Analysis of recursively parallel programs. In: Proceedings of Principles of Programming Languages, POPL 2012, pp. 203–214. ACM (2012)

    Google Scholar 

  4. Cai, X., Ogawa, M.: Well-Structured Pushdown Systems. In: D’Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 121–136. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40184-8_10

    Chapter  Google Scholar 

  5. Haddad, S., Schmitz, S., Schnoebelen, P.: The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. In: Proceedings of Logic in Computer Science, LICS 2012, pp. 355–364. IEEE (2012)

    Google Scholar 

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

    Google Scholar 

  7. Lei, S., Cai, X., Ogawa, M.: Termination and boundedness for well-structured pushdown systems. In: Proceedings of International Symposium on Theoretical Aspects of Software Engineering, TASE 2016, pp. 22–29 (2016)

    Google Scholar 

  8. Leroux, J., Praveen, M., Sutre, G.: Hyper-Ackermannian bounds for pushdown vector addition systems. In: Proceedings of Joint Meeting of Computer Science Logic and Logic in Computer Science, CSL-LICS 2014, pp. 1–10 (2014)

    Google Scholar 

  9. Lipton, R.J.: The reachability problem requires exponential space. Technical report, Yale University (1976)

    Google Scholar 

  10. Minsky, M.L.: Computation: Finite and Infinite Machines. American Mathematical Monthly (1968)

    Google Scholar 

  11. Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616–628. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15155-2_54

    Chapter  Google Scholar 

Download references

Acknowledgements

This research is partially supported by NSFC project 61472238, 61261130589, and 61511140100. The authors would like to thank Prof. Mizuhito Ogawa and anonymous reviewers for their helpful comments on the earlier version of this work.

Author information

Authors and Affiliations

  1. School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, No. 800, Dongchuan Rd, Shanghai, 200240, China

    Chunmiao Li & Xiaojuan Cai

Authors
  1. Chunmiao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaojuan Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaojuan Cai .

Editor information

Editors and Affiliations

  1. Umeå University, Umeå, Sweden

    Frank Drewes

  2. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  3. University of Giessen, Giessen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Li, C., Cai, X. (2017). Hardness Results for Coverability Problem of Well-Structured Pushdown Systems. In: Drewes, F., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2017. Lecture Notes in Computer Science(), vol 10168. Springer, Cham. https://doi.org/10.1007/978-3-319-53733-7_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-53733-7_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-53732-0

  • Online ISBN: 978-3-319-53733-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation