arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1705.03392cs.AIcs.DCcs.LO
收藏

Asynchronous Announcements

IRIT(图卢兹计算机研究所);CNRS(法国国家科学研究中心);University of Toulouse(图卢兹大学);LORIA(洛林计算机科学及其应用实验室);University of Lorraine(洛林大学)

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

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑