arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.06015cs.NIcs.LO
收藏

分组交换网络中的死锁

Deadlock in packet switching networks

Anna Stramaglia, Jeroen J. A. Keiren, Hans Zantema

AI总结:

本文形式化定义了分组交换网络中的全局、局部和弱三种死锁概念,明确其关系,并利用nuXmv模型检查器实现死锁检测,实验证明能有效发现微妙死锁。

摘要:

分组交换网络中的死锁是一种状态,即一个或多个消息尚未到达其目标,却无法再进一步前进。我们在分组交换网络的背景下形式化了三种不同的死锁概念,分别称为全局死锁、局部死锁和弱死锁。我们确立了这些概念之间的精确关系,并证明它们刻画了不同的死锁集合。此外,我们使用符号模型检查器nuXmv实现了对分组交换网络无死锁性的检查。我们通过实验表明,该实现在发现分组交换网络中微妙的死锁情况方面是有效的。

英文摘要:

A deadlock in a packet switching network is a state in which one or more messages have not yet reached their target, yet cannot progress any further. We formalize three different notions of deadlock in the context of packet switching networks, to which we refer as global, local and weak deadlock. We establish the precise relations between these notions, and prove they characterize different sets of deadlocks. Moreover, we implement checking of deadlock freedom of packet switching networks using the symbolic model checker nuXmv. We show experimentally that the implementation is effective at finding subtle deadlock situations in packet switching networks.

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

↑