{"id":"https://openalex.org/W1998608869","doi":"https://doi.org/10.1145/1326554.1326559","title":"Undecidability of bisimilarity by defender's forcing","display_name":"Undecidability of bisimilarity by defender's forcing","publication_year":2008,"publication_date":"2008-02-01","ids":{"openalex":"https://openalex.org/W1998608869","doi":"https://doi.org/10.1145/1326554.1326559","mag":"1998608869"},"language":"en","primary_location":{"id":"doi:10.1145/1326554.1326559","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1326554.1326559","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/3438033","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083815456","display_name":"Petr Jan\u010dar","orcid":"https://orcid.org/0000-0002-8738-9850"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Petr Jan\u010dar","raw_affiliation_strings":["Technical University of Ostrava, Ostrava -- Poruba, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Ostrava, Ostrava -- Poruba, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009728620","display_name":"J\u01d0\u0155\u0131 Srba","orcid":"https://orcid.org/0000-0001-5551-6547"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jiv\u0159\u00ed Srba","raw_affiliation_strings":["Aalborg University, Aalborg East, Denmark","Aalborg Univ., Aalborg East, Denmark#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aalborg University, Aalborg East, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Aalborg Univ., Aalborg East, Denmark#TAB#","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083815456"],"corresponding_institution_ids":["https://openalex.org/I142208455"],"apc_list":null,"apc_paid":null,"fwci":2.4832,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.88629698,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"55","issue":"1","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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.9983999729156494,"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.9979000091552734,"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.8827895522117615},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8453888893127441},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.6600450277328491},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.567837119102478},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5625668168067932},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5554924607276917},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.5247071981430054},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.5190442204475403},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.43049150705337524},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3830551505088806},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3281717002391815},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.322564959526062},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17118144035339355},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.15254589915275574},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.10610437393188477},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07992836833000183}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8827895522117615},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8453888893127441},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6600450277328491},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.567837119102478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5625668168067932},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5554924607276917},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.5247071981430054},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.5190442204475403},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.43049150705337524},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3830551505088806},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3281717002391815},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.322564959526062},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17118144035339355},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.15254589915275574},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.10610437393188477},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07992836833000183},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.0},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1326554.1326559","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1326554.1326559","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:dspace.vsb.cz:10084/64971","is_oa":false,"landing_page_url":"http://hdl.handle.net/10084/64971","pdf_url":null,"source":{"id":"https://openalex.org/S4306401668","display_name":"DSpace V\u0160B-TUO (V\u0160B-TUO)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142208455","host_organization_name":"VSB - Technical University of Ostrava","host_organization_lineage":["https://openalex.org/I142208455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/06416c30-a24b-11dc-8188-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/06416c30-a24b-11dc-8188-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jancar, P & Srba, J 2008, 'Undecidability of Bisimilarity by Defender's Forcing', Journal of the ACM, vol. 55, no. 1. https://doi.org/10.1145/1326554.1326559","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:zenodo.org:3438033","is_oa":true,"landing_page_url":"https://zenodo.org/record/3438033","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:3438033","is_oa":true,"landing_page_url":"https://zenodo.org/record/3438033","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G3676660081","display_name":null,"funder_award_id":"1M0567MSM0021622419","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"}],"funders":[{"id":"https://openalex.org/F4320321005","display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","ror":"https://ror.org/037n8p820"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W45603849","https://openalex.org/W63532070","https://openalex.org/W88975855","https://openalex.org/W203690387","https://openalex.org/W1491036809","https://openalex.org/W1497139784","https://openalex.org/W1501673292","https://openalex.org/W1503973138","https://openalex.org/W1517623691","https://openalex.org/W1524771661","https://openalex.org/W1532207056","https://openalex.org/W1547543932","https://openalex.org/W1547562281","https://openalex.org/W1555553717","https://openalex.org/W1561267729","https://openalex.org/W1577972941","https://openalex.org/W1589224558","https://openalex.org/W1607820520","https://openalex.org/W1965551437","https://openalex.org/W1978469611","https://openalex.org/W1993997214","https://openalex.org/W1994584977","https://openalex.org/W2005312844","https://openalex.org/W2006265470","https://openalex.org/W2021473546","https://openalex.org/W2022264236","https://openalex.org/W2035561341","https://openalex.org/W2037747061","https://openalex.org/W2051521505","https://openalex.org/W2067785662","https://openalex.org/W2068361557","https://openalex.org/W2068462394","https://openalex.org/W2085533703","https://openalex.org/W2111753126","https://openalex.org/W2113148168","https://openalex.org/W2115698108","https://openalex.org/W2118539487","https://openalex.org/W2132295002","https://openalex.org/W2136937307","https://openalex.org/W2142944765","https://openalex.org/W2172111426","https://openalex.org/W2340102009","https://openalex.org/W2561675875","https://openalex.org/W2617771285","https://openalex.org/W2623970819","https://openalex.org/W2724823900","https://openalex.org/W2912614885","https://openalex.org/W2951623158","https://openalex.org/W2977679477","https://openalex.org/W3203832456","https://openalex.org/W4232505977","https://openalex.org/W4244719572","https://openalex.org/W6629634244","https://openalex.org/W6630104300","https://openalex.org/W6632601584","https://openalex.org/W6632745820"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W1991406344","https://openalex.org/W1972232894","https://openalex.org/W2472752294","https://openalex.org/W1511257926","https://openalex.org/W1486486721","https://openalex.org/W2012479020","https://openalex.org/W2522490152","https://openalex.org/W2074593591","https://openalex.org/W2049492436"],"abstract_inverted_index":{"Stirling":[0,97],"[1996,":[1],"1998]":[2],"proved":[3],"the":[4,24,50,57,66,103,110,120,125,137,164,187,200],"decidability":[5,25,62,188],"of":[6,26,33,42,61,63,70,112,163,217,229],"bisimilarity":[7,27,41,64,81,113,192,219],"on":[8,82,114,193],"so-called":[9,221],"normed":[10,121],"pushdown":[11,47,86,172,223],"processes.":[12],"This":[13,91],"result":[14,126],"was":[15,88,92],"substantially":[16],"extended":[17],"by":[18,45,95,127,150],"S\u00e9nizergues":[19],"[1998,":[20],"2005]":[21],"who":[22],"showed":[23],"for":[28,65,167,190,220],"regular":[29],"(or":[30,171,224],"equational)":[31],"graphs":[32],"finite":[34],"out-degree;":[35],"this":[36],"essentially":[37],"coincides":[38],"with":[39],"weak":[40,80,191,218],"processes":[43],"generated":[44],"(unnormed)":[46],"automata":[48],"where":[49],"\u03b5":[51,84],"-transitions":[52],"can":[53],"only":[54],"deterministically":[55],"pop":[56],"stack.":[58],"The":[59,140],"question":[60,104,189],"more":[67],"general":[68],"class":[69],"so":[71],"called":[72],"Type":[73,115],"-1":[74,116],"systems,":[75,117],"which":[76],"is":[77,142,202],"equivalent":[78],"to":[79,136],"unrestricted":[83],"-popping":[85],"processes,":[87,197],"left":[89],"open.":[90],"repeatedly":[93],"indicated":[94],"both":[96],"and":[98,204],"S\u00e9nizergues.":[99],"Here":[100],"we":[101,108,131,159,185,211],"answer":[102],"negatively,":[105],"that":[106,199],"is,":[107],"show":[109,212],"undecidability":[111],"even":[118,205],"in":[119,154],"case.":[122],"We":[123,146],"achieve":[124],"applying":[128],"a":[129,155,227],"technique":[130],"call":[132],"Defender's":[133],"Forcing,":[134],"referring":[135],"bisimulation":[138],"games.":[139],"idea":[141],"simple,":[143],"yet":[144],"powerful.":[145],"demonstrate":[147],"its":[148],"versatility":[149],"deriving":[151],"further":[152],"results":[153],"uniform":[156],"way.":[157],"First,":[158],"classify":[160],"several":[161],"versions":[162],"undecidable":[165,203],"problems":[166],"prefix":[168],"rewrite":[169],"systems":[170],"automata)":[173],"as":[174],"\u03a0":[175],"0":[176],"1":[177,181,182,207,208,214,215],"-complete":[178],"or":[179],"\u03a3":[180,206,213],"-complete.":[183,209],"Second,":[184],"solve":[186],"PA":[194],"(Process":[195],"Algebra)":[196],"showing":[198],"problem":[201],"Third,":[210],"-completeness":[216],"parallel":[222],"multiset)":[225],"automata,":[226],"subclass":[228],"(labeled,":[230],"place/transition)":[231],"Petri":[232],"nets.":[233]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2016-06-24T00:00:00"}