{"id":"https://openalex.org/W2322615457","doi":"https://doi.org/10.1007/s00165-016-0364-4","title":"Correctness and concurrent complexity of the Black-White Bakery Algorithm","display_name":"Correctness and concurrent complexity of the Black-White Bakery Algorithm","publication_year":2016,"publication_date":"2016-03-29","ids":{"openalex":"https://openalex.org/W2322615457","doi":"https://doi.org/10.1007/s00165-016-0364-4","mag":"2322615457"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-016-0364-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-016-0364-4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00165-016-0364-4.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs00165-016-0364-4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022758187","display_name":"Wim H. Hesselink","orcid":"https://orcid.org/0000-0002-1413-4320"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Wim H. Hesselink","raw_affiliation_strings":["Johann Bernoulli Institute, University of Groningen, Groningen, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johann Bernoulli Institute, University of Groningen, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022758187"],"corresponding_institution_ids":["https://openalex.org/I169381384"],"apc_list":{"value":2780,"currency":"USD","value_usd":2780},"apc_paid":{"value":2780,"currency":"USD","value_usd":2780},"fwci":1.4254,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85597595,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"28","issue":"2","first_page":"325","last_page":"341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9890999794006348,"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/correctness","display_name":"Correctness","score":0.7272749543190002},{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.7120487689971924},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7098025679588318},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6427927613258362},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5134421586990356},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.506990909576416},{"id":"https://openalex.org/keywords/critical-section","display_name":"Critical section","score":0.4385029375553131},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4107493758201599},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4000054895877838},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3844401240348816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3542971611022949},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.276684045791626}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7272749543190002},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.7120487689971924},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7098025679588318},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6427927613258362},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5134421586990356},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.506990909576416},{"id":"https://openalex.org/C124343487","wikidata":"https://www.wikidata.org/wiki/Q1046373","display_name":"Critical section","level":2,"score":0.4385029375553131},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4107493758201599},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4000054895877838},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3844401240348816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3542971611022949},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.276684045791626},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00165-016-0364-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-016-0364-4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00165-016-0364-4.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.rug.nl:openaire/8e82e0a6-b75f-4f66-b3a0-bd2a825e2455","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/8e82e0a6-b75f-4f66-b3a0-bd2a825e2455","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hesselink, W H 2016, 'Correctness and concurrent complexity of the Black-White Bakery Algorithm', Formal Aspects of Computing, vol. 28, no. 2, pp. 325-341. https://doi.org/10.1007/s00165-016-0364-4","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.rug.nl:publications/8e82e0a6-b75f-4f66-b3a0-bd2a825e2455","is_oa":true,"landing_page_url":"https://hdl.handle.net/11370/8e82e0a6-b75f-4f66-b3a0-bd2a825e2455","pdf_url":"https://pure.rug.nl/ws/files/47503247/Correctness_and_concurrent_complexity_of_the_Black.pdf","source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hesselink, W H 2016, 'Correctness and concurrent complexity of the Black-White Bakery Algorithm', Formal Aspects of Computing, vol. 28, no. 2, pp. 325-341. https://doi.org/10.1007/s00165-016-0364-4","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00165-016-0364-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-016-0364-4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00165-016-0364-4.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2322615457.pdf","grobid_xml":"https://content.openalex.org/works/W2322615457.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W101802158","https://openalex.org/W143008620","https://openalex.org/W197500586","https://openalex.org/W1481018260","https://openalex.org/W1593488045","https://openalex.org/W1857327297","https://openalex.org/W1964727056","https://openalex.org/W2043801088","https://openalex.org/W2047110290","https://openalex.org/W2056740525","https://openalex.org/W2060457190","https://openalex.org/W2068333993","https://openalex.org/W2070908350","https://openalex.org/W2094104092","https://openalex.org/W2124525591","https://openalex.org/W2134926993","https://openalex.org/W2150869871","https://openalex.org/W2164578853","https://openalex.org/W2165821496","https://openalex.org/W2170523074","https://openalex.org/W2569787747","https://openalex.org/W4213369217","https://openalex.org/W4294549613"],"related_works":["https://openalex.org/W2024013325","https://openalex.org/W2056266125","https://openalex.org/W3204002890","https://openalex.org/W1947458937","https://openalex.org/W2567349856","https://openalex.org/W2052019968","https://openalex.org/W4237308985","https://openalex.org/W3046715470","https://openalex.org/W1878947383","https://openalex.org/W134702770"],"abstract_inverted_index":{"Abstract":[0],"Lamport\u2019s":[1],"Bakery":[2,41],"Algorithm":[3,42],"(Commun":[4],"ACM":[5],"17:453\u2013455,":[6],"1974":[7],")":[8,53],"implements":[9],"mutual":[10],"exclusion":[11],"for":[12,94,102],"a":[13,114],"fixed":[14],"number":[15,72],"of":[16,44,73,86,117],"threads":[17],"with":[18,113],"the":[19,25,45,55,62,65,71,91],"first-come":[20],"first-served":[21],"property.":[22],"It":[23],"has":[24],"disadvantage,":[26],"however,":[27],"that":[28,34,64,90],"it":[29],"uses":[30],"integer":[31],"communication":[32],"variables":[33],"can":[35],"become":[36],"arbitrarily":[37],"large.":[38],"Taubenfeld\u2019s":[39],"Black-White":[40],"(Proceedings":[43],"DISC.":[46],"LNCS,":[47],"vol":[48],"3274,":[49],"pp":[50],"56\u201370,":[51],"2004":[52],"keeps":[54],"integers":[56],"bounded,":[57],"and":[58,88,101],"is":[59,96,105,111],"adaptive":[60],"in":[61,98,107],"sense":[63],"time":[66],"complexity":[67,93],"only":[68],"depends":[69],"on":[70],"competing":[74],"threads,":[75],"say":[76],"N":[77,99,108],".":[78,109],"The":[79],"present":[80],"paper":[81],"offers":[82],"an":[83],"assertional":[84,121],"proof":[85],"correctness":[87],"shows":[89],"concurrent":[92],"throughput":[95],"linear":[97],",":[100],"individual":[103],"progress":[104],"quadratic":[106],"This":[110],"proved":[112],"bounded":[115],"version":[116],"UNITY,":[118],"i.e.,":[119],"by":[120],"means.":[122]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":4}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}