{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T01:19:13Z","timestamp":1790817553354,"version":"4.1.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030892395","type":"print"},{"value":"9783030892401","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89240-1_10","type":"book-chapter","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T05:01:04Z","timestamp":1634619664000},"page":"140-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Population Protocols with Unreliable Communication"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6660-5673","authenticated-orcid":false,"given":"Mikhail","family":"Raskin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: ACM Symposium on Principles of Distributed Computing, pp. 290\u2013299. ACM (2004)","DOI":"10.1145\/1011767.1011810"},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006). https:\/\/doi.org\/10.1007\/s00446-005-0138-3","journal-title":"Distrib. Comput."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11864219_5","volume-title":"Distributed Computing","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 61\u201375. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11864219_5"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-75142-7_5","volume-title":"Distributed Computing","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 20\u201332. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75142-7_5"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279\u2013304 (2007). https:\/\/doi.org\/10.1007\/s00446-007-0040-2","journal-title":"Distrib. Comput."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst. 3(4), 13:1\u201313:28 (2008)","DOI":"10.1145\/1452001.1452003"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BF01872848","volume":"2","author":"KR Apt","year":"1988","unstructured":"Apt, K.R., Francez, N., Katz, S.: Appraising fairness in languages for distributed programming. Distrib. Comput. 2(4), 226\u2013241 (1988). https:\/\/doi.org\/10.1007\/BF01872848","journal-title":"Distrib. Comput."},{"key":"10_CR8","unstructured":"Bertrand, N., Bouyer, P., Majumdar, A.: Reconfiguration and message losses in parameterized broadcast networks. In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27\u201330, 2019, Amsterdam, the Netherlands. LIPIcs, vol. 140, pp. 32:1\u201332:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"10_CR9","unstructured":"Blondin, M., Esparza, J., Jaax, S.: Expressive power of oblivious consensus protocols (2019). arXiv:1902.01668"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-10877-8_5","volume-title":"Principles of Distributed Systems","author":"I Chatzigiannakis","year":"2009","unstructured":"Chatzigiannakis, I., Dolev, S., Fekete, S.P., Michail, O., Spirakis, P.G.: Not all fair probabilistic schedulers are equivalent. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 33\u201347. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10877-8_5"},{"key":"10_CR11","unstructured":"Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: Passively mobile communicating logarithmic space machines. Technical report (2010)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11776178_4","volume-title":"Distributed Computing in Sensor Systems","author":"C Delporte-Gallet","year":"2006","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: When birds die: making population protocols fault-tolerant. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol. 4026, pp. 51\u201366. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11776178_4"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-77096-1_24","volume-title":"Principles of Distributed Systems","author":"C Delporte-Gallet","year":"2007","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: Secretive birds: privacy in population protocols. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 329\u2013342. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77096-1_24"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2018.09.005","volume":"754","author":"GA Di Luna","year":"2019","unstructured":"Di Luna, G.A., Flocchini, P., Izumi, T., Izumi, T., Santoro, N., Viglietta, G.: On the power of weaker pairwise interaction: fault-tolerant simulation of population protocols. Theoret. Comput. Sci. 754, 35\u201349 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2018.09.005","volume":"754","author":"GA Di Luna","year":"2019","unstructured":"Di Luna, G.A., Flocchini, P., Izumi, T., Izumi, T., Santoro, N., Viglietta, G.: Population protocols with faulty interactions: the impact of a leader. Theor. Comput. Sci. 754, 35\u201349 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"10_CR16","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/978-3-662-48653-5_40","volume-title":"Distributed Computing","author":"D Doty","year":"2015","unstructured":"Doty, D., Soloveichik, D.: Stable leader election in population protocols requires linear time. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 602\u2013616. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48653-5_40"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinite-state systems. In: LICS, pp. 70\u201380. IEEE Computer Society (1998)","DOI":"10.1109\/LICS.1998.705644"},{"key":"10_CR19","unstructured":"Esparza, J., Ganty, P., Majumdar, R., Weil-Kennedy, C.: Verification of immediate observation population protocols. In: 29th International Conference on Concurrency Theory (CONCUR 2018). LIPIcs, vol. 118, pp. 31:1\u201331:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00446-021-00390-x","volume":"34","author":"J Esparza","year":"2021","unstructured":"Esparza, J., Jaax, S., Raskin, M., Weil-Kennedy, C.: The complexity of verifying population protocols. Distrib. Comput. 34(2), 133\u2013177 (2021). https:\/\/doi.org\/10.1007\/s00446-021-00390-x","journal-title":"Distrib. Comput."},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-030-21571-2_20","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"J Esparza","year":"2019","unstructured":"Esparza, J., Raskin, M., Weil-Kennedy, C.: Parameterized analysis of immediate observation petri nets. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 365\u2013385. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_20"},{"key":"10_CR22","unstructured":"Friedman, R., Birman, K.: Trading consistency for availability in distributed systems. Technical report (1996)"},{"key":"10_CR23","unstructured":"Guerraoui, R., Ruppert, E.: Even small birds are unique: population protocols with identifiers (2007)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-642-02930-1_40","volume-title":"Automata, Languages and Programming","author":"R Guerraoui","year":"2009","unstructured":"Guerraoui, R., Ruppert, E.: Names trump malice: tiny mobile agents can tolerate byzantine failures. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 484\u2013495. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_40"},{"issue":"4","key":"10_CR25","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/71.920585","volume":"12","author":"MH Karaata","year":"2001","unstructured":"Karaata, M.H.: Self-stabilizing strong fairness under weak fairness. IEEE Trans. Parallel Distrib. Syst. 12(4), 337\u2013345 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"22","key":"10_CR26","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1016\/j.tcs.2011.02.003","volume":"412","author":"O Michail","year":"2011","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Mediated population protocols. Theoret. Comput. Sci. 412(22), 2434\u20132450 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR27","unstructured":"Raskin, M.: Population protocols with unreliable communication (2021). arXiv:1902.10041"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89240-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T04:34:45Z","timestamp":1725942885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89240-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030892395","9783030892401"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89240-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/ALGOSENSORS2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}