通信模式逻辑:认知与拓扑视角
Communication Pattern Logic: Epistemic and Topological Views
AI总结:
提出通信模式逻辑,通过更新Kripke模型和单纯复形研究通信可能失败时的分布式全信息协议,证明集体互模拟性在模型更新中得以保持且不同语义对应。
摘要:
我们提出通信模式逻辑。通信模式描述了进程或智能体之间如何相互通知,独立于信息内容。分布式计算中的全信息协议是所有智能体相互通知的特例。我们在通信可能失败的分布式计算模型中研究此协议:智能体对其接收到的消息是确定的,但对其他智能体接收到的消息可能不确定。在具有分布式知识以及通信模式模态的动态认知逻辑中,后者通过更新 Kripke 模型来解释。我们提出了通信模式逻辑的公理化,并证明了当用通信模式更新模型时,集体互模拟性(比较模型的分布式知识)得以保持。我们也可以通过更新单纯复形(一种著名的分布式计算拓扑框架)来解释通信模式。我们证明了不同语义是对应的,并提出了单纯复形之间的集体互模拟。
英文摘要:
We propose communication pattern logic. A communication pattern describes how processes or agents inform each other, independently of the information content. The full-information protocol in distributed computing is the special case wherein all agents inform each other. We study this protocol in distributed computing models where communication might fail: an agent is certain about the messages it receives, but it may be uncertain about the messages other agents have received. In a dynamic epistemic logic with distributed knowledge and with modalities for communication patterns, the latter are interpreted by updating Kripke models. We propose an axiomatization of communication pattern logic, and we show that collective bisimilarity (comparing models on their distributed knowledge) is preserved when updating models with communication patterns. We can also interpret communication patterns by updating simplicial complexes, a well-known topological framework for distributed computing. We show that the different semantics correspond, and propose collective bisimulation between simplicial complexes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。