{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:26:01Z","timestamp":1742963161522,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500856"},{"type":"electronic","value":"9783030500863"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50086-3_8","type":"book-chapter","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T12:03:09Z","timestamp":1591704189000},"page":"133-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Derivation of Heard-of Predicates from Elementary Behavioral Patterns"],"prefix":"10.1007","author":[{"given":"Adam","family":"Shimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lie","family":"Hurault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Queinnec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2018.02.019","volume":"726","author":"M Biely","year":"2018","unstructured":"Biely, M., Robinson, P., Schmid, M., Schwarz, U., Winkler, K.: Gracefully degrading consensus and k-set agreement in directed dynamic networks. Theor. Comput. Sci. 726, 41\u201377 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.02.019","journal-title":"Theor. Comput. Sci."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-24550-3_11","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"B Charron-Bost","year":"2011","unstructured":"Charron-Bost, B., Debrat, H., Merz, S.: Formal verification of consensus algorithms tolerating malicious faults. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 120\u2013134. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24550-3_11"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-662-47666-6_42","volume-title":"Automata, Languages, and Programming","author":"B Charron-Bost","year":"2015","unstructured":"Charron-Bost, B., F\u00fcgger, M., Nowak, T.: Approximate consensus in highly dynamic networks: the role of averaging algorithms. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 528\u2013539. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_42"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Schiper, A.: The heard-of model: computing in distributed systems with benign faults. Distrib. Comput. 22(1), 49\u201371 (2009). https:\/\/doi.org\/10.1007\/s00446-009-0084-6","journal-title":"Distrib. Comput."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2015.01.024","volume":"584","author":"\u00c9 Coulouma","year":"2015","unstructured":"Coulouma, \u00c9., Godard, E., Peters, J.: A characterization of oblivious message adversaries for which consensus is solvable. Theor. Comput. Sci. 584, 80\u201390 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.01.024","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1145\/2914770.2837650","volume":"51","author":"C Dr\u0103goi","year":"2016","unstructured":"Dr\u0103goi, C., Henzinger, T.A., Zufferey, D.: PSync: a partially synchronous language for fault-tolerant distributed algorithms. SIGPLAN Not. 51(1), 400\u2013415 (2016). https:\/\/doi.org\/10.1145\/2914770.2837650","journal-title":"SIGPLAN Not."},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","volume":"2","author":"T Elrad","year":"1982","unstructured":"Elrad, T., Francez, N.: Decomposition of distributed programs into communication-closedlayers. Sci. Comput. Program. 2(3), 155\u2013173 (1982). https:\/\/doi.org\/10.1016\/0167-6423(83)90013-8","journal-title":"Sci. Comput. Program."},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Gafni, E.: Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. In: 17th ACM Symposium on Principles of Distributed Computing, PODC 1998, pp. 143\u2013152 (1998). https:\/\/doi.org\/10.1145\/277697.277724","DOI":"10.1145\/277697.277724"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-319-63390-9_12","volume-title":"Computer Aided Verification","author":"O Mari\u0107","year":"2017","unstructured":"Mari\u0107, O., Sprenger, C., Basin, D.: Cutoff bounds for consensus algorithms. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 217\u2013237. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_12"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Nowak, T., Schmid, U., Winkler, K.: Topological characterization of consensus under general message adversaries. In: 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019 (2019). https:\/\/doi.org\/10.1145\/3293611.3331624","DOI":"10.1145\/3293611.3331624"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BFb0028994","volume-title":"STACS 89","author":"N Santoro","year":"1989","unstructured":"Santoro, N., Widmayer, P.: Time is not a healer. In: Monien, B., Cori, R. (eds.) STACS 1989. LNCS, vol. 349, pp. 304\u2013313. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0028994"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Shimi, A., Hurault, A., Qu\u00e9innec, P.: Characterizing asynchronous message-passing models through rounds. In: 22nd International Conference on Principles of Distributed Systems (OPODIS 2018), pp. 18:1\u201318:17 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2018.18","DOI":"10.4230\/LIPIcs.OPODIS.2018.18"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Shimi, A., Hurault, A., Queinnec, P.: Derivation of heard-of predicates from elementary behavioral patterns (2020). arXiv:2004.10619","DOI":"10.1007\/978-3-030-50086-3_8"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50086-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T23:02:16Z","timestamp":1717887736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50086-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500856","9783030500863"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50086-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valletta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malta","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2020\/forte","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":"25","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":"1","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":"40% - 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","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":"3","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 virtually 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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}