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

重探Dolev等人的BFS生成树算法的收敛性

Revisited Convergence of Dolev et al BFS Spanning Tree Algorithm

Karine Altisen, Marius Bozga

AI总结:

针对Dolev等人的BFS生成树算法现有收敛性证明的局限性,研究提出通用不公平守护进程假设下的构造性收敛证明,并在PADEC框架中完成形式化验证。

摘要:

我们针对在不公平守护进程这一通用假设下运行的Dolev等人的BFS生成树算法,给出了收敛性的构造性证明。该算法已有的证明要么采用非构造性原理(如反证法),要么受限于通用性更低的执行守护进程(如弱公平守护进程)。本研究通过定义良基序和势函数解决了这些局限,确保了通用场景下的收敛性。该证明已在PADEC——一个基于Coq的自稳定算法验证框架——中完成完全形式化。

英文摘要:

We provide a constructive proof for the convergence of Dolev et al's BFS spanning tree algorithm running under the general assumption of an unfair daemon. Already known proofs of this algorithm are either using non-constructive principles (e.g., proofs by contradiction) or are restricted to less general execution daemons (e.g., weakly fair). In this work, we address these limitations by defining the well-founded orders and potential functions ensuring convergence in the general case. The proof has been fully formalized in PADEC, a Coq-based framework for certification of self-stabilization algorithm.

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

↑