arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.04546cs.LOcs.MA
收藏

具有非阻塞会合机制的参数化网络安全性分析

Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous

Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder

AI总结:

本文研究非阻塞会合语义下参数化网络的覆盖性问题,证明其为EXPSPACE完全,并在协议状态可划分为请求态与应答态时给出多项式时间算法,同时证明全体进程到达终止状态的存在性问题不可判定。

摘要:

我们考虑由多个进程组成的网络,这些进程都执行相同的有限状态协议,并通过会合机制进行通信。当一个进程请求会合时,另一个进程可以响应它,并且两者都相应地改变其控制状态。我们在此关注一种称为非阻塞的特定语义,在该语义下,请求会合的进程即使没有进程能够响应它,也可以改变其状态。在此背景下,我们研究配置的参数化覆盖性问题,该问题在于确定是否存在某个初始进程数量以及某条执行路径,使得能够到达一个比给定配置更大的配置。我们证明该问题是EXPSPACE完全的,并且如果协议被划分为两个状态集合——即进程可以从中请求会合的状态集合和可以从中应答会合的状态集合——则该问题可以在多项式时间内解决。我们还证明,在我们的背景下,是否存在一条执行路径使所有进程都到达终止状态的问题是不可判定的。这两个问题在经典会合语义下都可以在多项式时间内解决。

英文摘要:

We consider networks of processes that all execute the same finite-state protocol and communicate via a rendez-vous mechanism. When a process requests a rendez-vous, another process can respond to it and they both change their control states accordingly. We focus here on a specific semantics, called non-blocking, where the process requesting a rendez-vous can change its state even if no process can respond to it. In this context, we study the parameterised coverability problem of a configuration, which consists in determining whether there is an initialnumber of processes and an execution allowing to reach a configuration bigger than a given one. We show that this problem is EXPSPACE-complete and can be solved in polynomial time if the protocol is partitioned into two sets of states, the states from which a process can request a rendez-vous and the ones from which it can answer one. We also prove that the problem of the existence of an execution bringing all the processes in a final state is undecidable in our context. These two problems can be solved in polynomial time with the classical rendez-vous semantics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑