{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:14:17Z","timestamp":1760202857229},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030349912"},{"type":"electronic","value":"9783030349929"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34992-9_19","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T18:02:48Z","timestamp":1573754568000},"page":"243-255","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fault Tolerant Network Constructors"],"prefix":"10.1007","author":[{"given":"Othon","family":"Michail","sequence":"first","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]},{"given":"Michail","family":"Theofilatos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"crossref","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)","journal-title":"Distrib. Comput."},{"issue":"4","key":"19_CR2","doi-asserted-by":"crossref","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)","journal-title":"Distrib. Comput."},{"issue":"4","key":"19_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1452001.1452003","volume":"3","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. ACM Trans. Auton. Adapt. Syst. 3(4), 1\u201328 (2008)","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-03850-6_4","volume-title":"Principles of Distributed Systems","author":"J Beauquier","year":"2013","unstructured":"Beauquier, J., Blanchard, P., Burman, J.: Self-stabilizing leader election in population protocols over arbitrary communication graphs. In: Baldoni, R., Nisse, N., van Steen, M. (eds.) OPODIS 2013. LNCS, vol. 8304, pp. 38\u201352. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03850-6_4"},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.ic.2016.12.002","volume":"255","author":"C Cooper","year":"2017","unstructured":"Cooper, C., Lamani, A., Viglietta, G., Yamashita, M., Yamauchi, Y.: Constructing self-stabilizing oscillators in population protocols. Inf. Comput. 255, 336\u2013351 (2017)","journal-title":"Inf. Comput."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Derakhshandeh, Z., Dolev, S., Gmyr, R., Richa, A.W., Scheideler, C., Strothmann, T.: Brief announcement: amoebot-a new model for programmable matter. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 220\u2013222. ACM (2014)","DOI":"10.1145\/2612669.2612712"},{"issue":"1","key":"19_CR7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11047-017-9658-6","volume":"17","author":"JJ Daymude","year":"2018","unstructured":"Daymude, J.J., et al.: On the runtime of universal coating for programmable matter. Nat. Comput. 17(1), 81\u201396 (2018)","journal-title":"Nat. Comput."},{"key":"19_CR8","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"},{"issue":"1","key":"19_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02278851","volume":"7","author":"S Dolev","year":"1993","unstructured":"Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read\/write atomicity. Distrib. Comput. 7(1), 3\u201316 (1993)","journal-title":"Distrib. Comput."},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-319-57586-5_38","volume-title":"Algorithms and Complexity","author":"GA Luna Di","year":"2017","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. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 454\u2013466. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_38"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Di Luna, G.A., Flocchini, P., Santoro, N., Viglietta, G., Yamauchi, Y.: Shape formation by programmable particles. Distrib. Comput. 1\u201333 (2019)","DOI":"10.1007\/s00446-019-00350-6"},{"key":"19_CR12","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)"},{"issue":"3","key":"19_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/PL00008934","volume":"14","author":"B Ducourthial","year":"2001","unstructured":"Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators. Distrib. Comput. 14(3), 147\u2013162 (2001)","journal-title":"Distrib. Comput."},{"issue":"4","key":"19_CR14","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.jpdc.2009.11.006","volume":"70","author":"N Guellati","year":"2010","unstructured":"Guellati, N., Kheddouci, H.: A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. J. Parallel Distrib. Comput. 70(4), 406\u2013415 (2010)","journal-title":"J. Parallel Distrib. Comput."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Gilpin, K., Knaian, A., Rus, D.: Robot pebbles: one centimeter modules for programmable matter through self-disassembly. In: 2010 IEEE International Conference on Robotics and Automation (ICRA), pp. 2485\u20132492. IEEE (2010)","DOI":"10.1109\/ROBOT.2010.5509817"},{"key":"19_CR16","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":"22","key":"19_CR17","doi-asserted-by":"crossref","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."},{"issue":"5","key":"19_CR18","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00446-017-0309-z","volume":"31","author":"O Michail","year":"2018","unstructured":"Michail, O.: Terminating distributed construction of shapes and patterns in a fair solution of automata. Distrib. Comput. 31(5), 343\u2013365 (2018)","journal-title":"Distrib. Comput."},{"issue":"6","key":"19_CR19","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s00446-012-0173-9","volume":"25","author":"R Mizoguchi","year":"2012","unstructured":"Mizoguchi, R., Ono, H., Kijima, S., Yamashita, M.: On space complexity of self-stabilizing leader election in mediated population protocol. Distrib. Comput. 25(6), 451\u2013460 (2012)","journal-title":"Distrib. Comput."},{"issue":"3","key":"19_CR20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00446-015-0257-4","volume":"29","author":"O Michail","year":"2016","unstructured":"Michail, O., Spirakis, P.G.: Simple and efficient local codes for distributed stable network construction. Distrib. Comput. 29(3), 207\u2013237 (2016)","journal-title":"Distrib. Comput."},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-51963-0_3","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"O Michail","year":"2017","unstructured":"Michail, O., Spirakis, P.G.: Network constructors: a model for programmable matter. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 15\u201334. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51963-0_3"},{"key":"19_CR22","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.jcss.2018.12.001","volume":"102","author":"O Michail","year":"2019","unstructured":"Michail, O., Skretas, G., Spirakis, P.G.: On the transformation capability of feasible mechanisms for programmable matter. J. Comput. Syst. Sci. 102, 18\u201339 (2019)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Michail, O., Spirakis, P.G., Theofilatos, M.: Fault tolerant network constructors. arXiv preprint arXiv:1903.05992 (2019)","DOI":"10.1007\/978-3-030-34992-9_19"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-05118-0_3","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"D Peleg","year":"2009","unstructured":"Peleg, D.: As good as it gets: competitive fault tolerance in network structures. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 35\u201346. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05118-0_3"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34992-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T05:26:21Z","timestamp":1576128381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34992-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030349912","9783030349929"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34992-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2019.lip6.fr\/symp\/sss2019\/","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":"45","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":"21","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":"7","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":"47% - 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.3","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.8","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)"}}]}}