Asynchronous Announcements - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Computational Logic Année : 2022

Asynchronous Announcements

Résumé

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 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.
Fichier principal
Vignette du fichier
1705.03392.pdf (462.9 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03762135 , version 1 (26-08-2022)

Identifiants

Citer

Philippe Balbiani, Hans van Ditmarsch, Saúl Fernández González. Asynchronous Announcements. ACM Transactions on Computational Logic, 2022, 23 (2, article 10), pp.1-38. ⟨10.1145/3481806⟩. ⟨hal-03762135⟩
25 Consultations
31 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More