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

用带信号的进程代数分析互斥

Analysing Mutual Exclusion using Process Algebra with Signals

Victor Dyseryn, Rob van Glabbeek, Peter Höfner

摘要:

与普遍的信念相反,通信系统(CCS)的演算和类似的进程代数缺乏表达能力,准确地捕捉互斥协议,而不丰富的语言与公平性假设。添加公平性假设来实现互斥协议似乎违反直觉。我们采用了一个信令运营商,它可以与CCS相结合,或其他进程结石,并表明,这种最小的扩展是表达足够的模型互斥:我们确认彼得森的互斥算法的正确性,两个进程,以及Lamport的面包店算法,在合理的假设下,底层内存模型。彼得森算法对两个以上进程的正确性需要对底层内存模型进行更强、更不现实的假设。

英文摘要:

In contrast to common belief, the Calculus of Communicating Systems (CCS) and similar process algebras lack the expressive power to accurately capture mutual exclusion protocols without enriching the language with fairness assumptions. Adding a fairness assumption to implement a mutual exclusion protocol seems counter-intuitive. We employ a signalling operator, which can be combined with CCS, or other process calculi, and show that this minimal extension is expressive enough to model mutual exclusion: we confirm the correctness of Peterson's mutual exclusion algorithm for two processes, as well as Lamport's bakery algorithm, under reasonable assumptions on the underlying memory model. The correctness of Peterson's algorithm for more than two processes requires stronger, less realistic assumptions on the underlying memory model.

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

↑