{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:22:10Z","timestamp":1743031330903,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_32","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T05:39:21Z","timestamp":1487137161000},"page":"435-446","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardness Results for Coverability Problem of Well-Structured Pushdown Systems"],"prefix":"10.1007","author":[{"given":"Chunmiao","family":"Li","sequence":"first","affiliation":[]},{"given":"Xiaojuan","family":"Cai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"PA Abdulla","year":"2000","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1), 109\u2013127 (2000)","journal-title":"Inf. Comput."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-59136-5_3","volume-title":"Handbook of Formal Languages","author":"J Autebert","year":"1997","unstructured":"Autebert, J., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 111\u2013174. Springer, Heidelberg (1997)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Emmi, M.: Analysis of recursively parallel programs. In: Proceedings of Principles of Programming Languages, POPL 2012, pp. 203\u2013214. ACM (2012)","DOI":"10.1145\/2103621.2103681"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-40184-8_10","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"X Cai","year":"2013","unstructured":"Cai, X., Ogawa, M.: Well-Structured Pushdown Systems. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 121\u2013136. Springer, Heidelberg (2013). doi:\n 10.1007\/978-3-642-40184-8_10"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013364. IEEE (2012)","DOI":"10.1109\/LICS.2012.46"},{"key":"32_CR6","unstructured":"Lazic, R.: The reachability problem for vector addition systems with a stack is not elementary. CoRR abs\/1310.1767 (2013)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"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\u201329 (2016)","DOI":"10.1109\/TASE.2016.30"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"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\u201310 (2014)","DOI":"10.1145\/2603088.2603146"},{"key":"32_CR9","unstructured":"Lipton, R.J.: The reachability problem requires exponential space. Technical report, Yale University (1976)"},{"key":"32_CR10","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. American Mathematical Monthly (1968)"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-15155-2_54","volume-title":"Mathematical Foundations of Computer Science 2010","author":"P Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616\u2013628. Springer, Heidelberg (2010). doi:\n 10.1007\/978-3-642-15155-2_54"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:44:55Z","timestamp":1558316695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/grammars.grlmc.com\/LATA2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}