{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:14:36Z","timestamp":1761610476459,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5688,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1998]]},"DOI":"10.1016\/s1571-0661(05)80256-7","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"147-158","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Strict Lower Bounds for Model Checking BPA"],"prefix":"10.1016","volume":"18","author":[{"given":"Richard","family":"Mayr","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80256-7_BIB1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","article-title":"Algebra of communicating processes with abstraction","volume":"37","author":"Bergstra","year":"1985","journal-title":"Theoretical Computer Science (TCS)"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB2","series-title":"International Conference on Concurrency Theory (CONCUR'97), volume 1243 of LNCS.","article-title":"Reachability analysis of pushdown automata: application to model checking","author":"Bouajjani","year":"1997"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB3","article-title":"Reachability Analysis of Pushdown Automata: Application to Model Checking","author":"Bouajjani","year":"1997","journal-title":"Technical report, VERIMAG"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BFb0084787","article-title":"Model checking for context-free processes","author":"Burkart","year":"1992","journal-title":"Proc. of CONCUR'92, volume 630 of LNCS"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB5","doi-asserted-by":"crossref","unstructured":"O. Burkart and B. Steffen. Model checking the full modal mu-calculus for infinite sequential processes. In Proceedings of ICALP'97, volume 1256 of LNCS. Springer Verlag, 1997.","DOI":"10.1007\/3-540-63165-8_198"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB6","doi-asserted-by":"crossref","unstructured":"E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic, volume 131 of LNCS, pages 52\u201371, 1981.","DOI":"10.1007\/BFb0025774"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB7","doi-asserted-by":"crossref","unstructured":"E. Emerson, C.S. Jutla, and A. Sistla. On model checking for fragments of \u03bc-calculus. In Proceedings of CAV'93, volume 697 of LNCS, pages 385\u2013396. Springer Verlag, 1993.","DOI":"10.1007\/3-540-56922-7_32"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB8","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional \u03bc-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"TCS"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB9","unstructured":"A. Mader. Verification of Modal Properties Using Boolean Equation Systems. PhD thesis, TU-M\u00fcnchen, 1997."},{"key":"10.1016\/S1571-0661(05)80256-7_BIB10","series-title":"FOCS'77","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB11","article-title":"A linear\u2014time model\u2014checking algorithm for the alternation\u2014free modal mu\u2014calculus","volume":"1","author":"Steffen","year":"1993","journal-title":"International Journal on Formal Methods in System Design"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(90)90110-4","article-title":"Local model checking in the modal \u03bc-calculus","volume":"89","author":"Stirling","year":"1991","journal-title":"Theoretical Computer Science"},{"year":"1990","series-title":"Handbook of Theoretical Computer Science: Volume A, Algorithms and Complexity","key":"10.1016\/S1571-0661(05)80256-7_BIB13"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB14","series-title":"International Conference on Computer Aided Verification (CAV'96), volume 1102 of LNCS.","article-title":"Pushdown processes: games and model checking","author":"Walukiewicz","year":"1996"},{"key":"10.1016\/S1571-0661(05)80256-7_BIB15","article-title":"Pushdown processes: games and model checking","author":"Walukiewicz","year":"1996","journal-title":"Technical Report RS-96-54, BRICS, Aarhus, Denmark, Longer version of a CAV'96 paper"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802567?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802567?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:00Z","timestamp":1761610080000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":15,"alternative-id":["S1571066105802567"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80256-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Strict Lower Bounds for Model Checking BPA","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80256-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}