等式否定任务的动态认知逻辑分析
A dynamic epistemic logic analysis of the equality negation task
摘要:
在本文中,我们研究了一个简单的无等待模型中的等式否定任务的可解性,其中进程通过读写共享变量或交换消息进行通信。在这个任务中,两个进程以集合{0,1,2}中的私有输入值开始,并且在通信之后,每个进程必须决定二进制输出值,使得当且仅当进程的输入值不同时,进程的输出相同。这个任务已经被认为是不可解决的;我们的目标是使用Goubault,Ledent和Rajsbaum在GandALF 2018中介绍的动态认知逻辑(DEL)方法来证明这个结果。我们表明,事实上,没有认知逻辑公式,解释为什么任务是不可解决的。我们通过扩展我们的DEL框架的语言来解决这个问题,这使我们能够构建这样的公式,并讨论其实用性。
英文摘要:
In this paper we study the solvability of the equality negation task in a simple wait-free model where processes communicate by reading and writing shared variables or exchanging messages. In this task, two processes start with a private input value in the set {0,1,2}, and after communicating, each one must decide a binary output value, so that the outputs of the processes are the same if and only if the input values of the processes are different. This task is already known to be unsolvable; our goal here is to prove this result using the dynamic epistemic logic (DEL) approach introduced by Goubault, Ledent and Rajsbaum in GandALF 2018. We show that in fact, there is no epistemic logic formula that explains why the task is unsolvable. We fix this issue by extending the language of our DEL framework, which allows us to construct such a formula, and discuss its utility.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。