跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.07919 · v1

Modular Parameterized Model Checking of Threshold-Based Distributed Algorithms

首次提交 2026-11-05 20:29
版本更新 2026-11-05 20:29
雷达观测 2026-11-06 11:06
arXiv ↗PDF ↗

摘要

We present a novel approach for model checking fault-tolerant distributed algorithms: instead of building large, monolithic algorithm models, we propose a modular approach where the user decomposes the algorithm into modules, verifies them individually, and replaces them with a synchronous abstraction. To enable our technique, we introduce a new system model that combines aspects of threshold automata and global synchronization protocols. We investigate the expressiveness of our new model, and present a (bounded) model checking procedure as well as a method for checking the correctness of the abstraction step. We implemented the technique and report on promising experimental results on a case study

作者备注:18 pages + 6 pages acknowledgements & references + 13 pages appendix = 37 pages; 9 Figures + 4 Algorithms

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-05 20:29 · 最新观测版本

Modular Parameterized Model Checking of Threshold-Based Distributed Algorithms

We present a novel approach for model checking fault-tolerant distributed algorithms: instead of building large, monolithic algorithm models, we propose a modular approach where the user decomposes the algorithm into modules, verifies them individually, and replaces them with a synchronous abstraction. To enable our technique, we introduce a new system model that combines aspects of threshold automata and global synchronization protocols. We investigate the expressiveness of our new model, and present a (bounded) model checking procedure as well as a method for checking the correctness of the abstraction step. We implemented the technique and report on promising experimental results on a case study

查看此版本解读 →查看此版本原文 ↗