分布式任务可解性的逻辑障碍判定
Determining Existence of Logical Obstructions to the Distributed Task Solvability
摘要:
为了研究分布式任务的可解性,Goubault,Ledent和Rajsbaum设计了一个动态认知逻辑模型,它等价于分布式计算的拓扑模型。在逻辑模型中,一个特定的分布式任务的不可解性可以通过找到一个称为逻辑阻塞的公式来证明。这种逻辑方法是非常有吸引力的,因为阻止解决任务的具体公式将具有不可解性的直观因素的含义。然而,当逻辑障碍存在时,如何系统地构造具体的逻辑障碍公式,还没有得到很好的研究。此外,还证明了有些任务是可解的,但不承认逻辑障碍。在本文中,我们提出了一种方法来证明不存在逻辑障碍的分布式任务的可解性,基于模拟技术。此外,我们给出了一种方法来确定是否存在一个逻辑障碍有限的协议和一个有限的任务,如果存在,构造一个具体的障碍。使用这种方法,我们证明了语言的标准认知逻辑,没有分布式知识,不承认逻辑障碍的可解性的$k$集协议的任务。我们还表明,即使在具有分布式知识的认知逻辑语言中,多轮立即快照也不存在逻辑障碍。此外,对于已知的所有模型,我们提供了一个具体的障碍公式,显示了不可解的$k$集协议任务。
英文摘要:
To study the distributed task solvability, Goubault, Ledent, and Rajsbaum devised a model of dynamic epistemic logic that is equivalent to the topological model for distributed computing. In the logical model, the unsolvability of a particular distributed task can be proven by finding a formula, called logical obstruction. This logical method is very appealing because the concrete formulas that prevent to solve task would have implications of intuitive factors for the unsolvability. However, it has not been well studied when a logical obstruction exists and how to systematically construct a concrete logical obstruction formula, if any. In addition, it is proved that there are some tasks that are solvable but do not admit logical obstructions. In this paper, we propose a method to prove the non-existence of logical obstructions to the solvability of distributed tasks, based on the technique of simulation. Moreover, we give a method to determine whether a logical obstruction exists or not for a finite protocol and a finite task, and if it exists, construct a concrete obstruction. Using this method, we demonstrate that the language of the standard epistemic logic, without distributed knowledge, does not admit logical obstruction to the solvability of $k$-set agreement tasks. We also show that there is no logical obstruction for multi-round immediate snapshot even in the language of epistemic logic with distributed knowledge. In addition, for the know-all model, we provide a concrete obstruction formula that shows the unsolvability of the $k$-set agreement task.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。