{"id":"https://openalex.org/W2007281030","doi":"https://doi.org/10.1145/2429069.2429124","title":"Checking NFA equivalence with bisimulations up to congruence","display_name":"Checking NFA equivalence with bisimulations up to congruence","publication_year":2013,"publication_date":"2013-01-22","ids":{"openalex":"https://openalex.org/W2007281030","doi":"https://doi.org/10.1145/2429069.2429124","mag":"2007281030"},"language":"en","primary_location":{"id":"doi:10.1145/2429069.2429124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2429069.2429124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00639716/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004609161","display_name":"Filippo Bonchi","orcid":"https://orcid.org/0000-0002-3433-723X"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Filippo Bonchi","raw_affiliation_strings":["CNRS, Lyon, France","LIP - Laboratoire de l'Informatique du Parall\u00e9lisme (46 All\u00e9e d'Italie 69364 LYON CEDEX 07 - France)","PLUME - Preuves et Langages (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, Lyon, France","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LIP - Laboratoire de l'Informatique du Parall\u00e9lisme (46 All\u00e9e d'Italie 69364 LYON CEDEX 07 - France)","institution_ids":["https://openalex.org/I113428412","https://openalex.org/I4210144566"]},{"raw_affiliation_string":"PLUME - Preuves et Langages (France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084356882","display_name":"Damien Pous","orcid":"https://orcid.org/0000-0002-1220-4399"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Damien Pous","raw_affiliation_strings":["CNRS, Lyon, France","LIP - Laboratoire de l'Informatique du Parall\u00e9lisme (46 All\u00e9e d'Italie 69364 LYON CEDEX 07 - France)","PLUME - Preuves et Langages (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, Lyon, France","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LIP - Laboratoire de l'Informatique du Parall\u00e9lisme (46 All\u00e9e d'Italie 69364 LYON CEDEX 07 - France)","institution_ids":["https://openalex.org/I113428412","https://openalex.org/I4210144566"]},{"raw_affiliation_string":"PLUME - Preuves et Langages (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.6131,"has_fulltext":true,"cited_by_count":150,"citation_normalized_percentile":{"value":0.99860017,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"457","last_page":"468"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","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/T11567","display_name":"semigroups and automata theory","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/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/antichain","display_name":"Antichain","score":0.9164546132087708},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.8851647973060608},{"id":"https://openalex.org/keywords/congruence","display_name":"Congruence (geometry)","score":0.6735537052154541},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.667258620262146},{"id":"https://openalex.org/keywords/coinduction","display_name":"Coinduction","score":0.6660028696060181},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6043047308921814},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6039265990257263},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4887232780456543},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.47435200214385986},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42085176706314087},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35829848051071167},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3447314500808716},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.12164556980133057}],"concepts":[{"id":"https://openalex.org/C136134351","wikidata":"https://www.wikidata.org/wiki/Q431937","display_name":"Antichain","level":3,"score":0.9164546132087708},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.8851647973060608},{"id":"https://openalex.org/C132074034","wikidata":"https://www.wikidata.org/wiki/Q154210","display_name":"Congruence (geometry)","level":2,"score":0.6735537052154541},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.667258620262146},{"id":"https://openalex.org/C40220748","wikidata":"https://www.wikidata.org/wiki/Q4227156","display_name":"Coinduction","level":3,"score":0.6660028696060181},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6043047308921814},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6039265990257263},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4887232780456543},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.47435200214385986},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42085176706314087},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35829848051071167},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3447314500808716},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.12164556980133057},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2429069.2429124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2429069.2429124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00639716v5","is_oa":true,"landing_page_url":"https://hal.science/hal-00639716","pdf_url":"https://hal.science/hal-00639716/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Principle of Programming Languages (POPL), Jan 2013, Roma, Italy. pp.457-468, ⟨10.1145/2429069.2429124⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:arpi.unipi.it:11568/900130","is_oa":false,"landing_page_url":"http://hdl.handle.net/11568/900130","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00639716v5","is_oa":true,"landing_page_url":"https://hal.science/hal-00639716","pdf_url":"https://hal.science/hal-00639716/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Principle of Programming Languages (POPL), Jan 2013, Roma, Italy. pp.457-468, ⟨10.1145/2429069.2429124⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3584739849","display_name":"Community of mathematics and fundamental computer science in Lyon","funder_award_id":"ANR-10-LABX-0070","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2007281030.pdf","grobid_xml":"https://content.openalex.org/works/W2007281030.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W342816535","https://openalex.org/W369805404","https://openalex.org/W1493925387","https://openalex.org/W1497805930","https://openalex.org/W1499210811","https://openalex.org/W1503973138","https://openalex.org/W1509918383","https://openalex.org/W1521923248","https://openalex.org/W1539196615","https://openalex.org/W1543741569","https://openalex.org/W1588454361","https://openalex.org/W1600605172","https://openalex.org/W1655990431","https://openalex.org/W1731774687","https://openalex.org/W1775921724","https://openalex.org/W1835362427","https://openalex.org/W1860772589","https://openalex.org/W1965551437","https://openalex.org/W1996761984","https://openalex.org/W1998084650","https://openalex.org/W2001817854","https://openalex.org/W2002089154","https://openalex.org/W2010924417","https://openalex.org/W2051521505","https://openalex.org/W2071152819","https://openalex.org/W2080267935","https://openalex.org/W2098817244","https://openalex.org/W2101032471","https://openalex.org/W2122493035","https://openalex.org/W2128995870","https://openalex.org/W2138693669","https://openalex.org/W2157821258","https://openalex.org/W2210656085","https://openalex.org/W2245651640","https://openalex.org/W6630098333","https://openalex.org/W6630104300","https://openalex.org/W6637190722","https://openalex.org/W6639111586"],"related_works":["https://openalex.org/W2463782052","https://openalex.org/W1541732450","https://openalex.org/W2518082944","https://openalex.org/W1488076266","https://openalex.org/W1562440999","https://openalex.org/W2603068949","https://openalex.org/W1820233200","https://openalex.org/W3101797533","https://openalex.org/W1827680569","https://openalex.org/W136487247"],"abstract_inverted_index":{"We":[0,32,52],"introduce":[1],"bisimulation":[2],"up":[3],"to":[4,36],"congruence":[5],"as":[6],"a":[7],"technique":[8],"for":[9],"proving":[10],"language":[11],"equivalence":[12],"of":[13,24],"non-deterministic":[14],"finite":[15],"automata.":[16],"Exploiting":[17],"this":[18],"technique,":[19],"we":[20,57],"devise":[21],"an":[22],"optimisation":[23],"the":[25,37,46],"classical":[26],"algorithm":[27],"by":[28,42],"Hopcroft":[29],"and":[30,44],"Karp.":[31],"compare":[33],"our":[34],"approach":[35],"recently":[38],"introduced":[39],"antichain":[40],"algorithms,":[41],"analysing":[43],"relating":[45],"two":[47],"underlying":[48],"coinductive":[49],"proof":[50],"methods.":[51],"give":[53],"concrete":[54],"examples":[55],"where":[56],"exponentially":[58],"improve":[59],"over":[60],"antichains;":[61],"experimental":[62],"results":[63],"moreover":[64],"show":[65],"non":[66],"negligible":[67],"improvements.":[68]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":16},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":29},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}