{"id":"https://openalex.org/W2330102972","doi":"https://doi.org/10.1007/s00165-016-0366-2","title":"Computing maximal weak and other bisimulations","display_name":"Computing maximal weak and other bisimulations","publication_year":2016,"publication_date":"2016-03-18","ids":{"openalex":"https://openalex.org/W2330102972","doi":"https://doi.org/10.1007/s00165-016-0366-2","mag":"2330102972"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-016-0366-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00165-016-0366-2","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","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/A5001135544","display_name":"Alexandre Boulgakov","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Alexandre Boulgakov","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012851566","display_name":"Thomas Gibson\u2212Robinson","orcid":"https://orcid.org/0000-0002-7330-6348"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thomas Gibson-Robinson","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045639409","display_name":"A. W. Roscoe","orcid":"https://orcid.org/0000-0001-7557-3901"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. W. Roscoe","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001135544"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":1.19808709,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84956595,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"28","issue":"3","first_page":"381","last_page":"407"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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.9991000294685364,"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.9925000071525574,"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.9714999794960022,"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/bisimulation","display_name":"Bisimulation","score":0.9553954601287842},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7492117881774902},{"id":"https://openalex.org/keywords/divergence","display_name":"Divergence (linguistics)","score":0.6291248798370361},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6279041767120361},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.6208928227424622},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5891033411026001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5287582278251648},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5133609175682068},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.4880567789077759},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41174572706222534},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4016062319278717},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3889695405960083},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32701337337493896},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25683292746543884}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.9553954601287842},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7492117881774902},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.6291248798370361},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6279041767120361},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.6208928227424622},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5891033411026001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5287582278251648},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5133609175682068},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.4880567789077759},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41174572706222534},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4016062319278717},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3889695405960083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32701337337493896},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25683292746543884},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00165-016-0366-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00165-016-0366-2","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G890232185","display_name":null,"funder_award_id":"EP/N022777/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1547562281","https://openalex.org/W1677803338","https://openalex.org/W1702401680","https://openalex.org/W1847383708","https://openalex.org/W1973642705","https://openalex.org/W1985161650","https://openalex.org/W2007572995","https://openalex.org/W2020618022","https://openalex.org/W2021473546","https://openalex.org/W2027689693","https://openalex.org/W2032370604","https://openalex.org/W2050362288","https://openalex.org/W2054858104","https://openalex.org/W2068361557","https://openalex.org/W2072538510","https://openalex.org/W2107482622","https://openalex.org/W2108796478","https://openalex.org/W2118382442","https://openalex.org/W2124325155","https://openalex.org/W2126186830","https://openalex.org/W2128510433","https://openalex.org/W2129384397","https://openalex.org/W2130820909","https://openalex.org/W2135048208","https://openalex.org/W2288740934","https://openalex.org/W2582970353","https://openalex.org/W2810491896","https://openalex.org/W3123797328","https://openalex.org/W3144368627"],"related_works":["https://openalex.org/W2288740934","https://openalex.org/W2135048208","https://openalex.org/W3145956809","https://openalex.org/W3022378301","https://openalex.org/W2104917880","https://openalex.org/W3013924750","https://openalex.org/W2026251929","https://openalex.org/W2760372412","https://openalex.org/W2169849200","https://openalex.org/W2246540852","https://openalex.org/W2354904146","https://openalex.org/W2407428392","https://openalex.org/W259536784","https://openalex.org/W2099639789","https://openalex.org/W2995181781","https://openalex.org/W1980535239","https://openalex.org/W1989459082","https://openalex.org/W100298686","https://openalex.org/W1976891319","https://openalex.org/W1999675231"],"abstract_inverted_index":{"Abstract":[0],"We":[1,79],"present":[2],"and":[3,18,54],"compare":[4],"several":[5],"algorithms":[6,82],"for":[7,76],"computing":[8],"the":[9,13,19,39,67],"maximal":[10,14,20],"strong":[11],"bisimulation,":[12,17],"divergence-respecting":[15,21],"delay":[16],"weak":[22],"bisimulation":[23,31],"of":[24,42],"a":[25],"generalised":[26],"labelled":[27],"transition":[28],"system.":[29],"These":[30],"relations":[32],"preserve":[33],"CSP":[34],"semantics,":[35],"as":[36,38],"well":[37],"operational":[40,48],"semantics":[41,49],"programs":[43],"in":[44,72],"other":[45],"languages":[46],"with":[47],"described":[50],"by":[51],"such":[52,77],"GLTSs":[53],"relying":[55],"only":[56],"on":[57,81,90],"observational":[58],"equivalence.":[59],"They":[60],"can":[61],"therefore":[62],"be":[63],"used":[64],"to":[65],"combat":[66],"space":[68],"explosion":[69],"problem":[70],"faced":[71],"explicit":[73],"model":[74],"checking":[75],"languages.":[78],"concentrate":[80],"which":[83,92],"work":[84],"efficiently":[85],"when":[86],"implemented":[87],"rather":[88],"than":[89],"ones":[91],"have":[93],"low":[94],"asymptotic":[95],"growth.":[96]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}