{"id":"https://openalex.org/W1975081600","doi":"https://doi.org/10.1017/s0960129503003992","title":"Complexity of weak bisimilarity and regularity for BPA and BPP","display_name":"Complexity of weak bisimilarity and regularity for BPA and BPP","publication_year":2003,"publication_date":"2003-07-31","ids":{"openalex":"https://openalex.org/W1975081600","doi":"https://doi.org/10.1017/s0960129503003992","mag":"1975081600"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129503003992","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129503003992","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052428086","display_name":"JI SRBA","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]},{"id":"https://openalex.org/I4210087405","display_name":"Danish National Research Foundation","ror":"https://ror.org/00znyv691","country_code":"DK","type":"nonprofit","lineage":["https://openalex.org/I4210087405"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"JI\u0158\u00cd SRBA","raw_affiliation_strings":["BRICS","Basic Research in Computer Science, Centre of the Danish National Research Foundation","Department of Computer Science, University of Aarhus, Ny Munkegade bld. 540, DK-8000 Aarhus C, Denmark Email:"],"affiliations":[{"raw_affiliation_string":"BRICS","institution_ids":[]},{"raw_affiliation_string":"Basic Research in Computer Science, Centre of the Danish National Research Foundation","institution_ids":["https://openalex.org/I4210087405"]},{"raw_affiliation_string":"Department of Computer Science, University of Aarhus, Ny Munkegade bld. 540, DK-8000 Aarhus C, Denmark Email:","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052428086"],"corresponding_institution_ids":["https://openalex.org/I204337017","https://openalex.org/I4210087405"],"apc_list":null,"apc_paid":null,"fwci":1.4183,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.80431614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"4","first_page":"567","last_page":"587"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9984999895095825,"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.9984999895095825,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9908000230789185,"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.9785000085830688,"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/bisimulation","display_name":"Bisimulation","score":0.879853367805481},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8670638203620911},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6618438959121704},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6536629796028137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5224848389625549},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.5087330937385559},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4456428587436676},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4282625913619995},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42672818899154663},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27732330560684204},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1593572199344635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14654585719108582}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.879853367805481},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8670638203620911},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6618438959121704},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6536629796028137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5224848389625549},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.5087330937385559},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4456428587436676},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4282625913619995},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42672818899154663},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27732330560684204},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1593572199344635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14654585719108582},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0960129503003992","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129503003992","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1485729746","https://openalex.org/W1488316634","https://openalex.org/W1503973138","https://openalex.org/W1547543932","https://openalex.org/W1547562281","https://openalex.org/W1554045856","https://openalex.org/W1555553717","https://openalex.org/W1560714495","https://openalex.org/W1562431272","https://openalex.org/W1577972941","https://openalex.org/W1589224558","https://openalex.org/W1598641851","https://openalex.org/W1965551437","https://openalex.org/W2003972637","https://openalex.org/W2006265470","https://openalex.org/W2045826397","https://openalex.org/W2051521505","https://openalex.org/W2106934908","https://openalex.org/W2107608134","https://openalex.org/W2109953449","https://openalex.org/W2118229393","https://openalex.org/W2136485937","https://openalex.org/W2137502532","https://openalex.org/W2172111426","https://openalex.org/W2268014521","https://openalex.org/W2340102009","https://openalex.org/W2474172766","https://openalex.org/W2618810206","https://openalex.org/W2912614885","https://openalex.org/W3005584262","https://openalex.org/W3023981071","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2136485937","https://openalex.org/W1554045856","https://openalex.org/W1598641851","https://openalex.org/W1965551437","https://openalex.org/W1601172863","https://openalex.org/W1514211561","https://openalex.org/W2154625854","https://openalex.org/W1547524815","https://openalex.org/W2951374406","https://openalex.org/W2107608134"],"abstract_inverted_index":{"It":[0],"is":[1,8,47],"an":[2],"open":[3],"problem":[4],"whether":[5],"weak":[6,43,103],"bisimilarity":[7,44,104,112],"decidable":[9],"for":[10,24,30,45,64,97,102],"Basic":[11,16],"Process":[12],"Algebra":[13],"(BPA)":[14],"and":[15,26,75],"Parallel":[17],"Processes":[18],"(BPP).":[19],"A":[20],"PSPACE":[21],"lower":[22,28,58,100],"bound":[23,29,59,101],"BPA":[25,106],"NP":[27,74],"BPP":[31,46],"were":[32],"demonstrated":[33],"by":[34,50],"Stribrna.":[35],"Mayr":[36],"recently":[37],"achieved":[38],"a":[39],"result,":[40],"saying":[41],"that":[42],"-hardness":[48],"result":[49],"Mayr,":[51],"which":[52],"we":[53,83,92],"improve":[54],"to":[55,110],"PSPACE.":[56],"No":[57],"has":[60],"previously":[61],"been":[62],"established":[63],"BPA.":[65],"We":[66],"demonstrate":[67],"DP-hardness,":[68],"which,":[69],"in":[70],"particular,":[71],"implies":[72],"both":[73],"co-NP-hardness.":[76],"In":[77],"each":[78],"of":[79,88,105,113],"the":[80,86,95],"bisimulation/regularity":[81],"problems":[82],"also":[84],"consider":[85],"classes":[87],"normed":[89],"processes.":[90],"Finally,":[91],"show":[93],"how":[94],"technique":[96],"proving":[98],"co-NP":[99],"can":[107],"be":[108],"applied":[109],"strong":[111],"BPP.":[114]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}