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

时分复用通信 over 卫星链路的通用算法形式化验证

Formal Verification of a Generic Algorithm for TDM Communication Over Inter Satellite Links

University of Novi Sad(诺维萨德大学)

Miroslav Popovic, Marko Popovic, Pavle Vasiljevic, Miodrag Djukic

AI总结:

本文采用 CSP 过程代数对时分复用通信算法进行形式化验证,通过构建模型并利用模型检查器证明算法的正确性。

摘要:

Python 联邦学习算法测试平台是一个针对边缘系统的简单 FL 框架,提供了三种通用算法:集中式联邦学习、去中心化联邦学习以及当前时间槽中的通用时分复用通信。前两种在之前的论文中使用 CSP 过程代数进行了形式化验证,本文采用相同方法对第三种进行形式化验证,分两个阶段进行。第一阶段中,我们构建 CSP 模型作为对真实 Python 代码的忠实表示。第二阶段中,模型检查器 PAT 自动证明了第三种通用算法的正确性,通过证明其无死锁(安全属性)和成功终止(活锁属性)来实现。

英文摘要:

The Python Testbed for Federated Learning Algorithms is a simple FL framework targeting edge systems, which provides the three generic algorithms: the centralized federated learning, the decentralized federated learning, and the universal TDM communication in the current time slot. The first two were formally verified in a previous paper using the CSP process algebra, and in this paper, we use the same approach to formally verify the third one, in two phases. In the first phase, we construct the CSP model as a faithful representation of the real Python code. In the second phase, the model checker PAT automatically proves correctness of the third generic algorithm by proving its deadlock freeness (safety property) and successful termination (liveness property).

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

↑