猜测k-同步性的缓冲区边界
Guessing the buffer bound for k-synchronizability
摘要:
如果表示执行的所有消息序列图可以被划分为$k$发送后接$k$接收的片段,则通信系统是$k$可同步的。前面已经表明,对于一个固定的给定$k$,可以决定一个通信系统是否是$k$ -同步的。这个结果是有趣的,因为可达性问题可以解决$k$ -同步系统。然而,决策过程假设边界$k$是固定的。在本文中,我们改进了这一结果,并表明,它是可能的,以决定是否存在这样的界$k$。
英文摘要:
A communicating system is $k$-synchronizable if all of the message sequence charts representing the executions can be divided into slices of $k$ sends followed by $k$ receptions. It was previously shown that, for a fixed given $k$, one could decide whether a communicating system is $k$-synchronizable. This result is interesting because the reachability problem can be solved for $k$-synchronizable systems. However, the decision procedure assumes that the bound $k$ is fixed. In this paper we improve this result and show that it is possible to decide if such a bound $k$ exists.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。