{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:00Z","timestamp":1750220340374,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"9","license":[{"start":{"date-parts":[[2022,8,19]],"date-time":"2022-08-19T00:00:00Z","timestamp":1660867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:p>A rigorous journey from the bakery algorithm to a distributed state machine.<\/jats:p>","DOI":"10.1145\/3513259","type":"journal-article","created":{"date-parts":[[2022,8,19]],"date-time":"2022-08-19T16:17:42Z","timestamp":1660925862000},"page":"58-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Deconstructing the bakery to build a distributed state machine"],"prefix":"10.1145","volume":"65","author":[{"given":"Leslie","family":"Lamport","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90056-0"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80018-3"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/365559.365617"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/358886.358892"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2013.03.003"},{"key":"e_1_2_1_6_1","volume-title":"SOFSEM 2001:  28th Conference on Current Trends in Theory and Practice of Informatics 2234","author":"Jayanti P.","year":"2001","unstructured":"Jayanti , P. , Tan , K. , Friedland , G. , and Katz , A . Bounding Lamport's bakery algorithm. In L. Pacholski and P. Ruzicka, eds ., SOFSEM 2001: 28th Conference on Current Trends in Theory and Practice of Informatics 2234 , Lecture Notes in Computer Science, Springer ( 2001 ), 261--270. Jayanti, P., Tan, K., Friedland, G., and Katz, A. Bounding Lamport's bakery algorithm. In L. Pacholski and P. Ruzicka, eds., SOFSEM 2001: 28th Conference on Current Trends in Theory and Practice of Informatics 2234, Lecture Notes in Computer Science, Springer (2001), 261--270."},{"key":"e_1_2_1_7_1","volume-title":"NIC #31507","author":"Johnson P.","year":"1975","unstructured":"Johnson , P. and Thomas , R . The maintenance of duplicate data bases. Request for Comment RFC #677 , NIC #31507 , ARPANET Network Working Group , ( January 1975 ). Johnson, P. and Thomas, R. The maintenance of duplicate data bases. Request for Comment RFC #677, NIC #31507, ARPANET Network Working Group, (January 1975)."},{"key":"e_1_2_1_8_1","unstructured":"Lamport L. Online supplemental material for Deconstructing the bakery to build a distributed state machine http:\/\/lamport.azurewebsites.net\/pubs\/bakery\/deconstruction.html.  Lamport L. Online supplemental material for Deconstructing the bakery to build a distributed state machine http:\/\/lamport.azurewebsites.net\/pubs\/bakery\/deconstruction.html."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/361082.361093"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/359863.359878"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.229904"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01786227"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01786631"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/361227.361234"},{"key":"e_1_2_1_16_1","unstructured":"Merz S. Online TLA+ specifications and proofs for \"deconstructing the bakery to build a distributed state machine.\" https:\/\/members.loria.fr\/SMerz\/papers\/distributed-bakery.html.  Merz S. Online TLA+ specifications and proofs for \"deconstructing the bakery to build a distributed state machine.\" https:\/\/members.loria.fr\/SMerz\/papers\/distributed-bakery.html."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.12.015"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/358527.358537"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30186-8_5"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2864-4_88"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3513259","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3513259","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:29Z","timestamp":1750191149000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3513259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,19]]},"references-count":22,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["10.1145\/3513259"],"URL":"https:\/\/doi.org\/10.1145\/3513259","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2022,8,19]]},"assertion":[{"value":"2022-08-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}