{"id":"https://openalex.org/W2069760917","doi":"https://doi.org/10.1016/s1571-0661(04)80531-0","title":"Modifications of Expansion Trees for Weak Bisimulation in BPA","display_name":"Modifications of Expansion Trees for Weak Bisimulation in BPA","publication_year":2003,"publication_date":"2003-02-01","ids":{"openalex":"https://openalex.org/W2069760917","doi":"https://doi.org/10.1016/s1571-0661(04)80531-0","mag":"2069760917"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80531-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80531-0","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(04)80531-0","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058931564","display_name":"Jitka St\u0159\u00edbrn\u00e1","orcid":null},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jitka St\u0159\u00edbrn\u00e1","raw_affiliation_strings":["Department of Computer Science Faculty of Informatics, Masaryk University Brno, Brno, Czech Republic","Department of Computer Science Faculty of Informatics, Masaryk University Brno Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science Faculty of Informatics, Masaryk University Brno, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"Department of Computer Science Faculty of Informatics, Masaryk University Brno Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014178090","display_name":"Ivana \u010cern\u00e1","orcid":"https://orcid.org/0000-0002-0711-9552"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Ivana \u010cern\u00e1","raw_affiliation_strings":["Department of Computer Science Faculty of Informatics, Masaryk University Brno, Brno, Czech Republic","Department of Computer Science Faculty of Informatics, Masaryk University Brno Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science Faculty of Informatics, Masaryk University Brno, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"Department of Computer Science Faculty of Informatics, Masaryk University Brno Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014178090"],"corresponding_institution_ids":["https://openalex.org/I21449261"],"apc_list":null,"apc_paid":null,"fwci":0.3546,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60717489,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"68","issue":"6","first_page":"19","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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.9988999962806702,"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.9939000010490417,"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/T11567","display_name":"semigroups and automata theory","score":0.9919999837875366,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.9087018370628357},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.8560829162597656},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6774141788482666},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6495104432106018},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5627160668373108},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5509549379348755},{"id":"https://openalex.org/keywords/observable","display_name":"Observable","score":0.5013773441314697},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.4667779505252838},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.42686212062835693},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3900705575942993},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3087647557258606},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11636105179786682},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.07209089398384094}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.9087018370628357},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.8560829162597656},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6774141788482666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6495104432106018},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5627160668373108},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5509549379348755},{"id":"https://openalex.org/C32848918","wikidata":"https://www.wikidata.org/wiki/Q845789","display_name":"Observable","level":2,"score":0.5013773441314697},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.4667779505252838},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.42686212062835693},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3900705575942993},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3087647557258606},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11636105179786682},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.07209089398384094},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(04)80531-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80531-0","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"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80531-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80531-0","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W258022877","https://openalex.org/W602812682","https://openalex.org/W1499210811","https://openalex.org/W1503973138","https://openalex.org/W1547562281","https://openalex.org/W1555553717","https://openalex.org/W1604199524","https://openalex.org/W1883453769","https://openalex.org/W1978469611","https://openalex.org/W1996761984","https://openalex.org/W2014466233","https://openalex.org/W2107608134","https://openalex.org/W3005584262"],"related_works":["https://openalex.org/W2107608134","https://openalex.org/W2136485937","https://openalex.org/W2752930545","https://openalex.org/W1554045856","https://openalex.org/W1598641851","https://openalex.org/W1965551437","https://openalex.org/W1514211561","https://openalex.org/W2040430117","https://openalex.org/W1601172863","https://openalex.org/W3101316517"],"abstract_inverted_index":{"The":[0],"purpose":[1],"of":[2,69,80,91,95,103,115],"this":[3],"work":[4],"is":[5,41],"to":[6,38,110,122],"examine":[7],"the":[8,31,63],"decidability":[9],"problem\nof":[10],"weak":[11],"bisimilarity":[12],"for":[13,54],"BPA-processes.":[14],"It":[15],"has":[16],"been":[17],"known":[18],"that\nstrong":[19],"bisimilarity,":[20,29],"which":[21],"may":[22],"be":[23,120],"considered":[24],"a":[25,59,76],"special":[26],"case":[27],"of\nweak":[28],"where":[30],"internal":[32],"(silent)":[33],"action":[34],"$\\tau$":[35],"is\ntreated":[36],"equally":[37],"observable":[39],"actions,":[40],"decidable":[42],"for\nBPA-processes":[43],"(\\cite{BBK,BCS,CHS}).":[44],"For":[45],"strong":[46,81,92],"bisimilarity,\nthese":[47],"processes":[48,56,72],"are":[49,73,85],"finitely":[50],"branching":[51],"and":[52,101],"so":[53],"two\nnon-bisimilar":[55],"there":[57],"exists":[58],"level":[60],"$n$":[61],"that\ndistinguishes":[62],"two":[64,71,86],"processes.":[65],"Additionally,":[66],"from":[67],"the\ndecidability":[68],"whether":[70],"equivalent":[74],"at":[75],"given\nlevel":[77],"$n$,":[78],"semidecidability":[79],"non-bisimilarity":[82],"directly\nfollows.":[83],"There":[84],"closely":[87],"related":[88],"approaches":[89,118],"to\nsemidecidability":[90],"equivalence:":[93],"construction":[94,102],"a\n(finite)":[96],"bisimulation":[97],"or":[98],"expansion":[99],"tree":[100],"a\nfinite":[104],"Caucal":[105],"base.":[106],"We":[107],"have":[108],"attempted":[109],"find":[111],"out":[112],"if":[113],"any":[114],"the\nabove":[116],"mentioned":[117],"could":[119],"generalized":[121],"(semi)decide\nweak":[123],"bisimilarity.":[124]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
