论文标题
确定参数化的Rendez-Vous网络中存在截止
Deciding the existence of cut-off in parameterized rendez-vous networks
论文作者
论文摘要
我们研究过程网络，这些过程都执行相同的有限国家协议并通过Rendez-Vous机制进行通信。给定协议，我们有兴趣检查是否存在一个称为截止的数字，以便在任何参与者数量更大的网络中，所有实体在某些最终状态中结束。在各种假设下，我们提供了该问题的可定性和复杂性结果，例如领导者的缺乏/存在或对称/非对称Rendez-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.
