arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.08641cs.FLcs.LO
收藏

消息传递系统中的流言

Gossiping in Message-Passing Systems

Benedikt Bollig, Marie Fortin, Paul Gastin

摘要:

我们研究了消息传递环境中的流言问题:当一个进程收到一条消息时,它必须决定发送者是否有比自己更新的关于其他进程的信息。这个问题是许多分布式算法的核心,它与形式化方法中有关分布式自动机表达能力的问题密切相关。我们提供了一个非确定性的八卦协议的消息传递系统与无界FIFO通道,只使用1000多个本地状态和有限的消息字母表。我们表明,这是最佳的意义上说,没有确定性的对应。作为一个应用程序,八卦协议使我们能够表明,消息传递系统捕获众所周知的线性时间时态逻辑扩展到并发设置。

英文摘要:

We study the gossip problem in a message-passing environment: When a process receives a message, it has to decide whether the sender has more recent information on other processes than itself. This problem is at the heart of many distributed algorithms, and it is tightly related to questions from formal methods concerning the expressive power of distributed automata. We provide a non-deterministic gossip protocol for message-passing systems with unbounded FIFO channels, using only finitely many local states and a finite message alphabet. We show that this is optimal in the sense that there is no deterministic counterpart. As an application, the gossip protocol allows us to show that message-passing systems capture well-known extensions of linear-time temporal logics to a concurrent setting.

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

↑