{"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":1760202857336},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030388072"},{"type":"electronic","value":"9783030388089"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-38808-9_4","type":"book-chapter","created":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T12:03:25Z","timestamp":1578917005000},"page":"53-70","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Dynamic Epistemic Logic Analysis of the Equality Negation Task"],"prefix":"10.1007","author":[{"given":"\u00c9ric","family":"Goubault","sequence":"first","affiliation":[]},{"given":"Marijana","family":"Lazi\u0107","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00e9my","family":"Ledent","sequence":"additional","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,14]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. Wiley, New York (2004)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/978-3-319-20451-2_38","volume-title":"Readings in Formal Epistemology","author":"Alexandru Baltag","year":"2016","unstructured":"Baltag, A., Moss, L., Solecki, S.: The logic of common knowledge, public announcements, and private suspicions. In: TARK VII, pp. 43\u201356 (1998). \nhttps:\/\/doi.org\/10.1007\/978-3-319-20451-2_38"},{"key":"4_CR3","unstructured":"Baltag, A., Renne, B.: Dynamic epistemic logic. In: The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University (2016). \nhttps:\/\/plato.stanford.edu\/archives\/win2016\/entries\/dynamic-epistemic\/"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/0196-6774(90)90020-F","volume":"11","author":"O Biran","year":"1990","unstructured":"Biran, O., Moran, S., Zaks, S.: A combinatorial characterization of the distributed 1-solvable tasks. J. Algorithms 11(3), 420\u2013440 (1990). \nhttps:\/\/doi.org\/10.1016\/0196-6774(90)90020-F","journal-title":"J. Algorithms"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Chor, B., Israeli, A., Li, M.: On processor coordination using asynchronous hardware. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 1987, pp. 86\u201397. ACM, New York (1987). \nhttps:\/\/doi.org\/10.1145\/41840.41848","DOI":"10.1145\/41840.41848"},{"key":"4_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-5839-4","volume-title":"Dynamic Epistemic Logic","author":"HV Ditmarsch","year":"2007","unstructured":"Ditmarsch, H.V., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-1-4020-5839-4"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985). \nhttps:\/\/doi.org\/10.1145\/3149.214121","journal-title":"J. ACM"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539796305766","volume":"28","author":"E Gafni","year":"1999","unstructured":"Gafni, E., Koutsoupias, E.: Three-processor tasks are undecidable. SIAM J. Comput. 28(3), 970\u2013983 (1999)","journal-title":"SIAM J. Comput."},{"key":"4_CR9","unstructured":"Goubault, E., Lazi\u0107, M., Ledent, J., Rajsbaum, S.: A dynamic epistemic logic analysis of the equality negation task. CoRR abs\/1909.03263 (2019). \nhttp:\/\/arxiv.org\/abs\/1909.03263"},{"key":"4_CR10","unstructured":"Goubault, E., Lazi\u0107, M., Ledent, J., Rajsbaum, S.: Wait-free solvability of equality negation tasks. In: 33rd International Symposium on Distributed Computing, DISC 2019, 14\u201318 October 2019, Budapest, Hungary (2019). \nhttps:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/11328\/"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.4204\/EPTCS.277.6","volume":"277","author":"\u00c9ric Goubault","year":"2018","unstructured":"Goubault, \u00c9., Ledent, J., Rajsbaum, S.: A simplicial complex model for dynamic epistemic logic to study distributed task computability. In: Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2018, Saarbr\u00fccken, Germany, 26\u201328th September 2018, pp. 73\u201387 (2018). \nhttps:\/\/doi.org\/10.4204\/EPTCS.277.6","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"4_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/C2011-0-07032-1","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Elsevier-Morgan Kaufmann, Amsterdam (2013). \nhttps:\/\/doi.org\/10.1016\/C2011-0-07032-1"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991). \nhttps:\/\/doi.org\/10.1145\/114005.102808","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Herlihy, M., Rajsbaum, S.: The decidability of distributed decision tasks (extended abstract). In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing (STOC), El Paso, Texas, USA, 4\u20136 May 1997, pp. 589\u2013598 (1997). \nhttps:\/\/doi.org\/10.1145\/258533.258652","DOI":"10.1145\/258533.258652"},{"issue":"6","key":"4_CR15","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858\u2013923 (1999). \nhttps:\/\/doi.org\/10.1145\/331524.331529","journal-title":"J. ACM"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Jayanti, P.: On the robustness of herlihy\u2019s hierarchy. In: Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, PODC 1993, pp. 145\u2013157. ACM, New York (1993). \nhttps:\/\/doi.org\/10.1145\/164051.164070","DOI":"10.1145\/164051.164070"},{"key":"4_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71962-5","volume-title":"Combinatorial Algebraic Topology","author":"D Kozlov","year":"2007","unstructured":"Kozlov, D.: Combinatorial Algebraic Topology. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-71962-5"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1137\/S0097539798335766","volume":"30","author":"W Lo","year":"2000","unstructured":"Lo, W., Hadzilacos, V.: All of us are smarter than any of us: nondeterministic wait-free hierarchies are not robust. SIAM J. Comput. 30(3), 689\u2013728 (2000). \nhttps:\/\/doi.org\/10.1137\/S0097539798335766","journal-title":"SIAM J. Comput."},{"key":"4_CR19","unstructured":"Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. In: Advances in Computing research, pp. 163\u2013183. JAI Press, Greenwich (1987)"},{"key":"4_CR20","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)"}],"container-title":["Lecture Notes in Computer Science","Dynamic Logic. New Trends and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38808-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T12:16:41Z","timestamp":1578917801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38808-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030388072","9783030388089"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38808-9_4","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":"14 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DALI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Dynamic Logic","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dali2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/workshop.dali.di.uminho.pt\/","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":"26","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":"12","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":"2","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":"46% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}