人口协议的计算能力
The computational power of population protocols
摘要:
我们考虑由Angluin等人引入的人口协议模型,其中匿名有限状态代理通过通信网络的全对族中的双向交互来稳定地计算其输入的多集的谓词。我们证明了在这个模型(和它的某些推广)中所有稳定可计算的谓词是半线性的,回答了一个关于模型的权力的中心公开问题。去除双向交互的假设,我们还考虑了几种变体的模型,其中代理人通过匿名消息传递进行通信,其中每个消息的接收者由对手选择,发送者不被识别到接收者。这些单向模型的区别在于消息是立即发送还是延迟后发送,发送方是否可以记录它已经发送了一条消息,以及接收方是否可以将传入的消息排队,拒绝接受新消息,直到它有机会发送自己的消息。我们的特点是类的谓词稳定计算,在这些单向模型使用自然子类的半线性谓词。
英文摘要:
We consider the model of population protocols introduced by Angluin et al., in which anonymous finite-state agents stably compute a predicate of the multiset of their inputs via two-way interactions in the all-pairs family of communication networks. We prove that all predicates stably computable in this model (and certain generalizations of it) are semilinear, answering a central open question about the power of the model. Removing the assumption of two-way interaction, we also consider several variants of the model in which agents communicate by anonymous message-passing where the recipient of each message is chosen by an adversary and the sender is not identified to the recipient. These one-way models are distinguished by whether messages are delivered immediately or after a delay, whether a sender can record that it has sent a message, and whether a recipient can queue incoming messages, refusing to accept new messages until it has had a chance to send out messages of its own. We characterize the classes of predicates stably computable in each of these one-way models using natural subclasses of the semilinear predicates.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。