{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,20]],"date-time":"2026-11-20T12:10:48Z","timestamp":1795176648127,"version":"4.10.3"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0305258CNS-0435201ITR-0331548"],"award-info":[{"award-number":["CNS-0305258CNS-0435201ITR-0331548"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0305258CNS-0435201ITR-0331548"],"award-info":[{"award-number":["CNS-0305258CNS-0435201ITR-0331548"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2008,11]]},"abstract":"<jats:p>\n                    This article studies self-stabilization in networks of anonymous, asynchronously interacting nodes where the size of the network is unknown. Constant-space protocols are given for Dijkstra-style round-robin token circulation, leader election in rings, two-hop coloring in degree-bounded graphs, and establishing consistent global orientation in an undirected ring. A protocol to construct a spanning tree in regular graphs using\n                    <jats:italic>O<\/jats:italic>\n                    (log\n                    <jats:italic>D<\/jats:italic>\n                    ) memory is also given, where\n                    <jats:italic>D<\/jats:italic>\n                    is the diameter of the graph. A general method for eliminating nondeterministic transitions from the self-stabilizing implementation of a large family of behaviors is used to simplify the constructions, and general conditions under which protocol composition preserves behavior are used in proving their correctness.\n                  <\/jats:p>","DOI":"10.1145\/1452001.1452003","type":"journal-article","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T10:32:31Z","timestamp":1228905151000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":76,"title":["Self-stabilizing population protocols"],"prefix":"10.1145","volume":"3","author":[{"given":"Dana","family":"Angluin","sequence":"first","affiliation":[{"name":"Yale University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Aspnes","sequence":"additional","affiliation":[{"name":"Yale University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael J.","family":"Fischer","sequence":"additional","affiliation":[{"name":"Yale University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hong","family":"Jiang","sequence":"additional","affiliation":[{"name":"Yale University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,12,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11502593_8"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0040-2"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.5"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301358"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.588622"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0066"},{"key":"e_1_2_1_9_1","volume-title":"Lecture Notes in Computer Science","volume":"2150","author":"Gradinariu M."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405048"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90107-9"},{"key":"e_1_2_1_12_1","volume-title":"Lecture Notes in Computer Science","volume":"3121","author":"Herman T."},{"key":"e_1_2_1_13_1","unstructured":"Higham L. and Myers S. 1999. Self-stabilizing token circulation on anonymous message passing rings. Tech. Rep. University of Calgary.  Higham L. and Myers S. 1999. Self-stabilizing token circulation on anonymous message passing rings. Tech. Rep. University of Calgary."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365691"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 9th International Workshop on Distributed Algorithms (WDAC). Springer","author":"Itkis G."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2004.1302973"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129777"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073977"}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1452001.1452003","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1452001.1452003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:30:06Z","timestamp":1750239006000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1452001.1452003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["10.1145\/1452001.1452003"],"URL":"https:\/\/doi.org\/10.1145\/1452001.1452003","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"value":"1556-4665","type":"print"},{"value":"1556-4703","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11]]},"assertion":[{"value":"2007-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-12-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}