arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1412.2497cs.CC
收藏

同音异义词种群协议,或使用少量标识符提供小计算空间

Homonym Population Protocols, or Providing a Small Space of Computation Using a Few Identifiers

Olivier Bournez, Johanne Cohen, Mikaël Rabie

摘要:

人口协议已被引入的Angluin等人。作为一个模型,其中n被动移动匿名有限状态代理稳定地计算他们的输入的多集通过交互对谓词。Guerraoui和Ruppert对该模型进行了扩展,以产生社区协议模型,其中代理具有唯一标识符,但只能存储有限数量的标识符。人口协议模型只能计算半线性谓词,而在社区协议模型中,整个社区的代理共同提供了一个具有O(n log n)空间的图灵机的权力。我们考虑上述模型的变化,我们得到一个涵盖和扩展已知结果的整体景观:通过考虑同音异义词的情况,也就是说,当几个代理可以共享相同的标识符时,我们提供了一个层次结构,该层次结构从没有标识符的情况开始(即,一个用于所有,即群体协议模型)到唯一标识符的情况(即,社区协议模型)。我们特别得到的空间O(logO(1)n)上的任何图灵机可以模拟至少O(logO(1)n)标识符,结果填补了所有以前的研究中留下的空白。我们的研究结果还扩展和重温,特别是Chatzigiannakis等人提供的层次结构。人口协议进行图灵机在有限的空间,解决的问题,这项工作之间的差距每代理空间O(log log n)(证明是等价的人口协议)和O(log n)(证明是等价的图灵机)。

英文摘要:

Population protocols have been introduced by Angluin et al. as a model in which n passively mobile anonymous finite-state agents stably compute a predicate on the multiset of their inputs via interactions by pairs. The model has been extended by Guerraoui and Ruppert to yield the community protocol models where agents have unique identifiers but may only store a finite number of the identifiers they already heard about. The population protocol models can only compute semi-linear predicates, whereas in the community protocol model the whole community of agents provides collectively the power of a Turing machine with a O(n log n) space. We consider variations on the above models and we obtain a whole landscape that covers and extends already known results: By considering the case of homonyms, that is to say the case when several agents may share the same identifier, we provide a hierarchy that goes from the case of no identifier (i.e. a single one for all, i.e. the population protocol model) to the case of unique identifiers (i.e. community protocol model). We obtain in particular that any Turing Machine on space O(logO(1) n) can be simulated with at least O(logO(1) n) identifiers, a result filling a gap left open in all previous studies. Our results also extend and revisit in particular the hierarchy provided by Chatzigiannakis et al. on population protocols carrying Turing Machines on limited space, solving the problem of the gap left by this work between per-agent space o(log log n) (proved to be equivalent to population protocols) and O(log n) (proved to be equivalent to Turing machines).

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

↑