Answers are grounded in this paper and cite their sources.
In distributed systems with processes that do not share a global clock, 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 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 offline monitoring of both future and past STL, as well as online monitoring of past STL. We evaluate our approach with multiple experiments, showcasing its efficacy in both real-world applications and synthetic examples.
No takes yet. Share an insight, caveat, or question.
Bonakdarpour et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: