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 is equivalent to one without dynamic modalities, just as for public announcement logic. A detailed example modelling message exchanging processes in distributed computing in closes our investigation.
Recommendations
Cited in
(7)- Asynchronous announcements in a public channel
- 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
- Reasoning about knowledge and messages in asynchronous multi-agent systems
- From public announcements to asynchronous announcements
- On two- and three-valued semantics for impure simplicial complexes
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)
