{"id":"https://openalex.org/W2045826397","doi":"https://doi.org/10.1016/s1571-0661(05)80256-7","title":"Strict Lower Bounds for Model Checking BPA","display_name":"Strict Lower Bounds for Model Checking BPA","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2045826397","doi":"https://doi.org/10.1016/s1571-0661(05)80256-7","mag":"2045826397"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80256-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80256-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)80256-7","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082358544","display_name":"Richard Mayr","orcid":"https://orcid.org/0009-0003-2164-9933"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Richard Mayr","raw_affiliation_strings":["Institut f\u00fcr Informatik Technische Universit\u00e4t M\u00fcnchen Arcisstr. 21, D-80290 M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik Technische Universit\u00e4t M\u00fcnchen Arcisstr. 21, D-80290 M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082358544"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":4.0676,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.94050622,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"18","issue":null,"first_page":"147","last_page":"158"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9782000184059143,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.8501293659210205},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.8236130475997925},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.745751678943634},{"id":"https://openalex.org/keywords/alternation","display_name":"Alternation (linguistics)","score":0.5215703845024109},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49659496545791626},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.48699742555618286},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.47143641114234924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45956331491470337},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.44583722949028015},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42256584763526917},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.40449345111846924},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.386050283908844},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.32939743995666504},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3161216378211975},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.31218916177749634},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2793494164943695}],"concepts":[{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8501293659210205},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.8236130475997925},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.745751678943634},{"id":"https://openalex.org/C26826806","wikidata":"https://www.wikidata.org/wiki/Q438358","display_name":"Alternation (linguistics)","level":2,"score":0.5215703845024109},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49659496545791626},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.48699742555618286},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.47143641114234924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45956331491470337},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.44583722949028015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42256584763526917},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.40449345111846924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.386050283908844},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.32939743995666504},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3161216378211975},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31218916177749634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2793494164943695},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s1571-0661(05)80256-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80256-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.492","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.492","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://flop.informatik.tu-muenchen.de/pub/theory/mayrri/bpa.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.3367","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.3367","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.ed.ac.uk/home/mayrri/bpa.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.53.4462","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.4462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.ed.ac.uk/home/mayrri/bpa_ws.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80256-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80256-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W260642817","https://openalex.org/W1504739534","https://openalex.org/W1589224558","https://openalex.org/W1590315663","https://openalex.org/W1590891429","https://openalex.org/W1791618115","https://openalex.org/W1795391326","https://openalex.org/W1992582873","https://openalex.org/W2015640848","https://openalex.org/W2017759899","https://openalex.org/W2023808162","https://openalex.org/W2078003433","https://openalex.org/W2158942489","https://openalex.org/W2268014521","https://openalex.org/W6609741714","https://openalex.org/W6635133958","https://openalex.org/W6656255003"],"related_works":["https://openalex.org/W2026191634","https://openalex.org/W4299312496","https://openalex.org/W2111351089","https://openalex.org/W1532207056","https://openalex.org/W1599423189","https://openalex.org/W2951143878","https://openalex.org/W3149488358","https://openalex.org/W2497725717","https://openalex.org/W2043435342","https://openalex.org/W1777291824"],"abstract_inverted_index":{"We":[0],"show":[1],"strict":[2],"lower":[3],"bounds":[4,41],"for":[5,13,117,139],"the":[6,28,45,102,106,126,134],"complexity":[7],"of":[8,98,105],"several":[9],"model":[10,25,46,121],"checking":[11,19,26,47,122],"problems":[12,48],"BPA":[14],"and":[15,51,65],"branching-time":[16],"logics.":[17],"Model":[18],"with":[20,27,37,74,125],"Hennessy-Milner":[21],"Logic":[22],"PSPACE-hard,":[23],"while":[24],"modal":[29,127],"\u00af-calculus":[30,128],"is":[31,129,136],"EXPTIME-hard.":[32],"By":[33],"combining":[34],"these":[35],"results":[36],"already":[38],"established":[39],"upper":[40],"it":[42],"follows":[43],"that":[44,120],"are":[49,70,86,89,95],"PSPACE-complete":[50],"EXPTIME-complete,":[52],"respectively.":[53],"1":[54],"Introduction":[55],"Basic":[56],"Process":[57],"Algebra":[58],"(BPA)":[59],"processes":[60,124],"were":[61],"defined":[62],"by":[63],"Bergstra":[64],"Klop":[66],"in":[67,81],"[BK85].":[68],"They":[69,94],"transition":[71],"systems":[72],"associated":[73],"Greibach":[75],"normal":[76],"form":[77],"(GNF)":[78],"context-free":[79,92],"grammars":[80],"which":[82],"only":[83,110],"left-most":[84],"derivations":[85],"permitted.":[87],"BPA-processes":[88],"also":[90],"called":[91],"processes.":[93],"a":[96,140],"subclass":[97],"pushdown":[99,107,123],"processes,":[100],"where":[101],"finite":[103],"control":[104],"automaton":[108],"has":[109,114],"one":[111],"state.":[112],"It":[113],"been":[115],"known":[116],"some":[118],"time":[119],"EXPTIME-complete":[130],"[Wal96a,":[131],"Wal96b].":[132],"Furthermore,":[133],"problem":[135],"even":[137],"EXPTIME-hard":[138],"...":[141]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}