arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1601.03767cs.DC
收藏

一种自稳定分布式算法的形式证明与改进

Formally Proving and Enhancing a Self-Stabilising Distributed Algorithm

Camille Coti, Charles Lakos, Laure Petrucci

摘要:

本文介绍了自稳定分布式算法的正式建模和验证技术的好处。研究了一种算法,该算法将一组由树型拓扑连接的进程转换为环形拓扑。有色Petri网模型不仅便于证明算法的正确性和自稳定性,而且还容易显示它具有终止性和沉默性的新性质。此外,正式的结果表明,该算法可以简化而不失一般性。

英文摘要:

This paper presents the benefits of formal modelling and verification techniques for self-stabilising distributed algorithms. An algorithm is studied, that takes a set of processes connected by a tree topology and converts it to a ring configuration. The Coloured Petri net model not only facilitates the proof that the algorithm is correct and self-stabilising but also easily shows that it enjoys new properties of termination and silentness. Further, the formal results show how the algorithm can be simplified without loss of generality.

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

↑