{"id":"https://openalex.org/W2663462053","doi":"https://doi.org/10.1145/3060140","title":"An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation","display_name":"An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation","publication_year":2017,"publication_date":"2017-04-30","ids":{"openalex":"https://openalex.org/W2663462053","doi":"https://doi.org/10.1145/3060140","mag":"2663462053"},"language":"en","primary_location":{"id":"doi:10.1145/3060140","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3060140","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"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":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/1855caf3-5280-4f44-b294-5c5b76d93443","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032619003","display_name":"Jan Friso Groote","orcid":"https://orcid.org/0000-0003-2196-6587"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jan Friso Groote","raw_affiliation_strings":["Eindhoven University of Technology, MB Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006029818","display_name":"David N. Jansen","orcid":"https://orcid.org/0000-0002-6636-3301"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"David N. Jansen","raw_affiliation_strings":["Radboud Universiteit Nijmegen"],"affiliations":[{"raw_affiliation_string":"Radboud Universiteit Nijmegen","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010819147","display_name":"Jeroen J. A. Keiren","orcid":"https://orcid.org/0000-0002-5772-9527"},"institutions":[{"id":"https://openalex.org/I7876267","display_name":"Open University of the Netherlands","ror":"https://ror.org/018dfmf50","country_code":"NL","type":"education","lineage":["https://openalex.org/I7876267"]},{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jeroen J. A. Keiren","raw_affiliation_strings":["Open University of the Netherlands and Radboud Universiteit Nijmegen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Open University of the Netherlands and Radboud Universiteit Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I7876267","https://openalex.org/I145872427"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036964869","display_name":"Anton Wijs","orcid":"https://orcid.org/0000-0002-2071-9624"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Anton J. Wijs","raw_affiliation_strings":["Eindhoven University of Technology, MB Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5032619003"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":5.4209,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.96372321,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"18","issue":"2","first_page":"1","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11567","display_name":"semigroups and automata theory","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/T10126","display_name":"Logic, programming, and type systems","score":0.9980000257492065,"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.8467330932617188},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6989221572875977},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6158583760261536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5613017082214355},{"id":"https://openalex.org/keywords/kripke-structure","display_name":"Kripke structure","score":0.5011861324310303},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.46019673347473145},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4416215121746063},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41538533568382263},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37254732847213745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3344799280166626},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.15008887648582458}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.8467330932617188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6989221572875977},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6158583760261536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5613017082214355},{"id":"https://openalex.org/C161913894","wikidata":"https://www.wikidata.org/wiki/Q1077740","display_name":"Kripke structure","level":3,"score":0.5011861324310303},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.46019673347473145},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4416215121746063},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41538533568382263},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37254732847213745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3344799280166626},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.15008887648582458},{"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/3060140","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3060140","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"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":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/1855caf3-5280-4f44-b294-5c5b76d93443","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/1855caf3-5280-4f44-b294-5c5b76d93443","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Groote, J F, Jansen, D N, Keiren, J J A & Wijs, A J 2017, 'An O(mlog n) algorithm for computing stuttering equivalence and branching bisimulation', ACM Transactions on Computational Logic, vol. 18, no. 2, 13. https://doi.org/10.1145/3060140","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/1855caf3-5280-4f44-b294-5c5b76d93443","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85027000745&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Groote, J F, Jansen, D N, Keiren, J J A & Wijs, A J 2017, 'An O(mlog n) algorithm for computing stuttering equivalence and branching bisimulation', ACM Transactions on Computational Logic, vol. 18, no. 2, 13. https://doi.org/10.1145/3060140","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/176627","is_oa":false,"landing_page_url":"http://hdl.handle.net/2066/176627","pdf_url":null,"source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Computational Logic, 18, 2, pp. 1-34","raw_type":"Article / Letter to editor"},{"id":"pmh:oai:research.ou.nl:publications/2834e58f-c12e-4634-9803-3c6d920be70c","is_oa":false,"landing_page_url":"https://hdl.handle.net/1820/2834e58f-c12e-4634-9803-3c6d920be70c","pdf_url":null,"source":{"id":"https://openalex.org/S4406922485","display_name":"Open University of the Netherlands Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Groote, J F, Jansen, D N, Keiren, J J A & Wijs, A J 2017, 'An O(m log n) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation', Acm Transactions on Computational Logic, vol. 18, no. 2, 13. https://doi.org/10.1145/3060140","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:ou:oai:research.ou.nl:publications/2834e58f-c12e-4634-9803-3c6d920be70c","is_oa":false,"landing_page_url":"https://research.ou.nl/en/publications/2834e58f-c12e-4634-9803-3c6d920be70c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Acm Transactions on Computational Logic, 18(2):13. Association for Computing Machinery (ACM)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/1855caf3-5280-4f44-b294-5c5b76d93443","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/1855caf3-5280-4f44-b294-5c5b76d93443","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"ACM Transactions on Computational Logic, 18(2):13. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/1855caf3-5280-4f44-b294-5c5b76d93443","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/1855caf3-5280-4f44-b294-5c5b76d93443","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Groote, J F, Jansen, D N, Keiren, J J A & Wijs, A J 2017, 'An O(mlog n) algorithm for computing stuttering equivalence and branching bisimulation', ACM Transactions on Computational Logic, vol. 18, no. 2, 13. https://doi.org/10.1145/3060140","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1506090769","https://openalex.org/W1563368561","https://openalex.org/W1577673148","https://openalex.org/W1655990431","https://openalex.org/W1689438917","https://openalex.org/W1903502063","https://openalex.org/W1973642705","https://openalex.org/W1985161650","https://openalex.org/W1990183105","https://openalex.org/W2021473546","https://openalex.org/W2025063471","https://openalex.org/W2050965526","https://openalex.org/W2061726621","https://openalex.org/W2068361557","https://openalex.org/W2091177009","https://openalex.org/W2105326662","https://openalex.org/W2107144615","https://openalex.org/W2122493035","https://openalex.org/W2127554679","https://openalex.org/W2130413791","https://openalex.org/W2137865376","https://openalex.org/W2138696525","https://openalex.org/W2149481500","https://openalex.org/W2231202055","https://openalex.org/W2243432867","https://openalex.org/W2264277655","https://openalex.org/W2357843841","https://openalex.org/W2472516302","https://openalex.org/W2810491896","https://openalex.org/W2952252756","https://openalex.org/W2964247817","https://openalex.org/W3144889436","https://openalex.org/W4231393247","https://openalex.org/W4289790492","https://openalex.org/W6793045953"],"related_works":["https://openalex.org/W2393457982","https://openalex.org/W2397347312","https://openalex.org/W4380538068","https://openalex.org/W3014656961","https://openalex.org/W2072801983","https://openalex.org/W2487055703","https://openalex.org/W4377371889","https://openalex.org/W2113623403","https://openalex.org/W1862126075","https://openalex.org/W2055932080"],"abstract_inverted_index":{"We":[0],"provide":[1],"a":[2,33,67],"new":[3,180],"algorithm":[4,37,73,110,131,181],"to":[5,42,161],"determine":[6,43,162],"stuttering":[7,135,186],"equivalence":[8,136,187],"with":[9],"time":[10,82],"complexity":[11,83],"O":[12,47,87,142],"(":[13,48,88,143],"m":[14,26,49],"log":[15,55],"n":[16,19,56],"),":[17],"where":[18,59],"is":[20,27,61],"the":[21,28,62,85,122],"number":[22,29],"of":[23,30,32,64,84,118,129,185],"states":[24],"and":[25,137,155,168,188],"transitions":[31],"Kripke":[34,123],"structure.":[35],"This":[36,179],"can":[38,111],"also":[39],"be":[40],"used":[41,173],"branching":[44,138,189],"bisimulation":[45,190],"in":[46,66,153],"(log":[50],"|":[51,53],"Act":[52,60],"+":[54],"))":[57],"time,":[58],"set":[63],"actions":[65],"labeled":[68],"transition":[69],"system.":[70],"Theoretically,":[71],"our":[72,109,130],"substantially":[74],"improves":[75],"upon":[76],"existing":[77,113],"algorithms,":[78],"which":[79],"all":[80],"have":[81],"form":[86],"mn":[89,144],")":[90,145],"at":[91],"best.":[92],"Moreover,":[93],"it":[94],"has":[95],"better":[96],"or":[97],"equal":[98],"space":[99,154],"complexity.":[100],"Practical":[101],"results":[102],"confirm":[103],"these":[104],"findings:":[105],"they":[106,170],"show":[107],"that":[108],"outperform":[112],"algorithms":[114,146,160],"by":[115],"several":[116],"orders":[117],"magnitude,":[119],"especially":[120],"when":[121],"structures":[124],"are":[125],"large.":[126],"The":[127,140],"importance":[128],"stretches":[132],"far":[133,149],"beyond":[134],"bisimulation.":[139],"known":[141],"were":[147,171],"already":[148],"more":[150,192],"efficient":[151],"(both":[152],"time)":[156],"than":[157],"most":[158],"other":[159],"behavioral":[163],"equivalences":[164],"(including":[165],"weak":[166],"bisimulation),":[167],"therefore":[169],"often":[172],"as":[174],"an":[175],"essential":[176],"preprocessing":[177],"step.":[178],"makes":[182],"this":[183],"use":[184],"even":[191],"attractive.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2017-06-30T00:00:00"}