Asynchronous announcements

DOI10.1145/3481806zbMATH Open1505.03038arXiv1705.03392OpenAlexW4211099339WikidataQ130871086 ScholiaQ130871086MaRDI QIDQ5034232FDOQ5034232

Authors: Philippe Balbiani, Saúl Fernández González, Hans van Ditmarsch 

Publication date: 24 February 2022

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Abstract: We propose a multi-agent epistemic logic of asynchronous announcements, where truthful announcements are publicly sent but individually received by agents, and in the order in which they were sent. Additional to epistemic modalities the logic contains dynamic modalities for making announcements and for receiving them. What an agent believes is a function of her initial uncertainty and of the announcements she has received. Beliefs need not be truthful, because announcements already made may not yet have been received. As announcements are true when sent, certain message sequences can be ruled out, just like inconsistent cuts in distributed computing. We provide a complete axiomatization for this emph{asynchronous announcement logic} (AA). It is a reduction system that also demonstrates that any formula in $AA$ is equivalent to one without dynamic modalities, just as for public announcement logic. A detailed example modelling message exchanging processes in distributed computing in $AA$ closes our investigation.

Full work available at URL: https://arxiv.org/abs/1705.03392

Recommendations

• Asynchronous announcements in a public channel
• Reasoning about knowledge and messages in asynchronous multi-agent systems
• From public announcements to asynchronous announcements
• Reasoning about Knowledge in Asynchronous Distributed Systems
• scientific article; zbMATH DE number 7444842

zbMATH Keywords

asynchronous systemsepistemic logicspublic announcements

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42)

Cited In (3)

• Communication pattern logic: epistemic and topological views
• A simplicial complex model for dynamic epistemic logic to study distributed task computability
• A runs-and-systems semantics for logics of announcements

This page was built for publication: Asynchronous announcements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034232)