基于动态认知逻辑的容错分布式计算模型
Models of fault-tolerant distributed computation via dynamic epistemic logic
摘要：
分布式计算模型的可计算能力由进程可用的通信介质、进程和通信的时序假设以及进程可能遭受的故障的性质决定。在一个配套文件中，我们展示了如何动态认知逻辑可以用来给一个正式的语义给定的分布式计算模型，精确地捕获所需的知识来解决分布式任务，如共识。此外，通过移动到由单纯复形定义的认知逻辑的对偶模型，拓扑不变量被暴露，这决定了任务的可解性。在本文中，我们将展示如何扩展上述设置，以包括在知识的过程中，知识的计算模型本身。该扩展描述了知识流程获得有关当前执行，在过程中没有输入值的问题。
英文摘要：
The computability power of a distributed computing model is determined by the communication media available to the processes, the timing assumptions about processes and communication, and the nature of failures that processes can suffer. In a companion paper we showed how dynamic epistemic logic can be used to give a formal semantics to a given distributed computing model, to capture precisely the knowledge needed to solve a distributed task, such as consensus. Furthermore, by moving to a dual model of epistemic logic defined by simplicial complexes, topological invariants are exposed, which determine task solvability. In this paper we show how to extend the setting above to include in the knowledge of the processes, knowledge about the model of computation itself. The extension describes the knowledge processes gain about the current execution, in problems where processes have no input values at all.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
