参数化神经网络截断存在性的判定
Deciding the existence of cut-off in parameterized rendez-vous networks
摘要:
我们研究网络的进程,所有执行相同的有限状态协议和通信感谢一个renove-vous机制。给定一个协议,我们感兴趣的是检查是否存在一个称为截止的数字,使得在任何具有更多参与者的网络中,都存在一个所有实体都以某些最终状态结束的执行。我们提供了这个问题的可判定性和复杂性的结果,在各种假设下,如缺席/存在的领导者或对称/非对称的renovation-vous。
英文摘要:
We study networks of processes which all execute the same finite-state protocol and communicate thanks to a rendez-vous mechanism. Given a protocol, we are interested in checking whether there exists a number, called a cut-off, such that in any networks with a bigger number of participants, there is an execution where all the entities end in some final states. We provide decidability and complexity results of this problem under various assumptions, such as absence/presence of a leader or symmetric/asymmetric rendez-vous.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。