跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2408.05033 · v2

Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed and Accuracy

首次提交 2024-08-09 20:37
版本更新 2026-11-16 17:49
雷达观测 2026-11-17 17:11
arXiv ↗PDF ↗

摘要

In distributed systems with processes that do not share a global clock, \emph{partial synchrony} can be achieved by clock synchronization that guarantees bounded clock skew among all processes. Existing solutions for distributed runtime verification under partial synchrony against temporal logic specifications are exact but suffer from significant computational overhead. In this paper, we propose an \emph{approximate} distributed monitoring algorithm for Signal Temporal Logic (STL) that mitigates this issue by abstracting away potential interleaving behaviors. This conservative abstraction enables a significant speedup, albeit with a tradeoff in precision. We address this tradeoff by combining our approximate monitor with its exact counterpart, gaining efficiency without sacrificing precision. Our framework supports \emph{offline} monitoring of both future and past STL, as well as \emph{online} monitoring of past STL. We evaluate our approach with multiple experiments, showcasing its efficacy in both real-world applications and synthetic examples.

作者备注:To appear in the STTT special issue of RV 2024

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

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

v2 · 2026-11-16 17:49 · 最新观测版本

Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed and Accuracy

In distributed systems with processes that do not share a global clock, \emph{partial synchrony} can be achieved by clock synchronization that guarantees bounded clock skew among all processes. Existing solutions for distributed runtime verification under partial synchrony against temporal logic specifications are exact but suffer from significant computational overhead. In this paper, we propose an \emph{approximate} distributed monitoring algorithm for Signal Temporal Logic (STL) that mitigates this issue by abstracting away potential interleaving behaviors. This conservative abstraction enables a significant speedup, albeit with a tradeoff in precision. We address this tradeoff by combining our approximate monitor with its exact counterpart, gaining efficiency without sacrificing precision. Our framework supports \emph{offline} monitoring of both future and past STL, as well as \emph{online} monitoring of past STL. We evaluate our approach with multiple experiments, showcasing its efficacy in both real-world applications and synthetic examples.

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