{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:42Z","timestamp":1750220382980,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["787367"],"award-info":[{"award-number":["787367"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GRK 2428"],"award-info":[{"award-number":["GRK 2428"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467918","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"115-125","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Decision Power of Weak Asynchronous Models of Distributed Computing"],"prefix":"10.1145","author":[{"given":"Philipp","family":"Czerner","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Guttenberg","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Helfrich","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-012-0175-7"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Dana Angluin. 1980. Local and Global Properties in Networks of Processors (Extended Abstract). In STOC. ACM 82--93.  Dana Angluin. 1980. Local and Global Properties in Networks of Processors (Extended Abstract). In STOC. ACM 82--93.","DOI":"10.1145\/800141.804655"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11502593_8"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0067-z"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0040-2"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087836"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"e_1_3_2_2_9_1","first-page":"1","article-title":"A Population Protocol for Exact Majority with O(log5\/3 n) Stabilization Time and Theta(log n) States. In DISC (LIPIcs, Vol. 121)","volume":"10","author":"Berenbrink Petra","year":"2018","unstructured":"Petra Berenbrink , Robert Els\u00e4sser , Tom Friedetzky , Dominik Kaaser , Peter Kling , and Tomasz Radzik . 2018 . A Population Protocol for Exact Majority with O(log5\/3 n) Stabilization Time and Theta(log n) States. In DISC (LIPIcs, Vol. 121) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 10 : 1 -- 10 :18. Petra Berenbrink, Robert Els\u00e4sser, Tom Friedetzky, Dominik Kaaser, Peter Kling, and Tomasz Radzik. 2018. A Population Protocol for Exact Majority with O(log5\/3 n) Stabilization Time and Theta(log n) States. In DISC (LIPIcs, Vol. 121). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 10:1--10:18.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087858"},{"key":"e_1_3_2_2_11_1","first-page":"1","article-title":"Expressive Power of Broadcast Consensus Protocols. In CONCUR (LIPIcs, Vol. 140)","volume":"31","author":"Blondin Michael","year":"2019","unstructured":"Michael Blondin , Javier Esparza , and Stefan Jaax . 2019 . Expressive Power of Broadcast Consensus Protocols. In CONCUR (LIPIcs, Vol. 140) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 31 : 1 -- 31 :16. Michael Blondin, Javier Esparza, and Stefan Jaax. 2019. Expressive Power of Broadcast Consensus Protocols. In CONCUR (LIPIcs, Vol. 140). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 31:1--31:16.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39074-6_5"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.08.026"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_15"},{"key":"e_1_3_2_2_15_1","volume-title":"Decision Power of Weak Asynchronous Models of Distributed Computing. CoRR","author":"Czerner Philipp","year":"2021","unstructured":"Philipp Czerner , Roland Guttenberg , Martin Helfrich , and Javier Esparza . 2021. Decision Power of Weak Asynchronous Models of Distributed Computing. CoRR , Vol. abs\/ 2102 .11630 ( 2021 ). arxiv: 2102.11630 https:\/\/arxiv.org\/abs\/2102.11630 Philipp Czerner, Roland Guttenberg, Martin Helfrich, and Javier Esparza. 2021. Decision Power of Weak Asynchronous Models of Distributed Computing. CoRR, Vol. abs\/2102.11630 (2021). arxiv: 2102.11630 https:\/\/arxiv.org\/abs\/2102.11630"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Yuval Emek and Roger Wattenhofer. 2013. Stone age distributed computing. In PODC. ACM 137--146.  Yuval Emek and Roger Wattenhofer. 2013. Stone age distributed computing. In PODC. ACM 137--146.","DOI":"10.1145\/2484239.2484244"},{"key":"e_1_3_2_2_17_1","first-page":"1","article-title":"A Classification of Weak Asynchronous Models of Distributed Computing. In CONCUR (LIPIcs, Vol. 171)","volume":"10","author":"Esparza Javier","year":"2020","unstructured":"Javier Esparza and Fabian Reiter . 2020 . A Classification of Weak Asynchronous Models of Distributed Computing. In CONCUR (LIPIcs, Vol. 171) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 10 : 1 -- 10 :16. Javier Esparza and Fabian Reiter. 2020. A Classification of Weak Asynchronous Models of Distributed Computing. In CONCUR (LIPIcs, Vol. 171). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 10:1--10:16.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36071-8_1"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Nissim Francez. 1986. Fairness. Springer.  Nissim Francez. 1986. Fairness. Springer.","DOI":"10.1007\/978-1-4612-4886-6"},{"volume-title":"ICALP (2) (Lecture Notes in Computer Science","author":"Guerraoui Rachid","key":"e_1_3_2_2_20_1","unstructured":"Rachid Guerraoui and Eric Ruppert . 2009. Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures . In ICALP (2) (Lecture Notes in Computer Science , Vol. 5556). Springer, 484-- 495 . Rachid Guerraoui and Eric Ruppert. 2009. Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. In ICALP (2) (Lecture Notes in Computer Science, Vol. 5556). Springer, 484--495."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0202-3"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212788"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Fabian Kuhn Nancy A. Lynch and Rotem Oshman. 2010. Distributed computation in dynamic networks. In STOC. ACM 513--522.  Fabian Kuhn Nancy A. Lynch and Rotem Oshman. 2010. Distributed computation in dynamic networks. In STOC. ACM 513--522.","DOI":"10.1145\/1806689.1806760"},{"key":"e_1_3_2_2_24_1","volume-title":"Justice and Fairness: The Ethics of Concurrent Termination. In ICALP (Lecture Notes in Computer Science","volume":"277","author":"Lehmann Daniel","year":"1981","unstructured":"Daniel Lehmann , Amir Pnueli , and Jonathan Stavi . 1981 . Impartiality , Justice and Fairness: The Ethics of Concurrent Termination. In ICALP (Lecture Notes in Computer Science , Vol. 115). Springer, 264-- 277 . Daniel Lehmann, Amir Pnueli, and Jonathan Stavi. 1981. Impartiality, Justice and Fairness: The Ethics of Concurrent Termination. In ICALP (Lecture Notes in Computer Science, Vol. 115). Springer, 264--277."},{"key":"e_1_3_2_2_25_1","unstructured":"Nancy A. Lynch. 1996. Distributed Algorithms .Morgan Kaufmann.  Nancy A. Lynch. 1996. Distributed Algorithms .Morgan Kaufmann."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.02.003"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2015.02.005"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2678280"},{"key":"e_1_3_2_2_29_1","first-page":"1","article-title":"Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment. In ICALP (LIPIcs, Vol. 80)","volume":"100","author":"Reiter Fabian","year":"2017","unstructured":"Fabian Reiter . 2017 . Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment. In ICALP (LIPIcs, Vol. 80) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 100 : 1 -- 100 :14. Fabian Reiter. 2017. Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment. In ICALP (LIPIcs, Vol. 80). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 100:1--100:14.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-008-9067-y"}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Event Italy","acronym":"PODC '21"},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467918","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":30,"alternative-id":["10.1145\/3465084.3467918","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467918","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}