Approximate distributed monitoring under partial synchrony: balancing speed & accuracy

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.

Authors

Institutions

Publication Details

Journal
International Journal on Software Tools for Technology Transfer
Published
2026-11-18
DOI
https://doi.org/10.1007/s10009-026-00870-0
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Approximate distributed monitoring under partial synchrony: balancing speed & accuracy

Borzoo Bonakdarpour, N. Ege Saraç, Anik Momtaz, Dejan Ničković
International Journal on Software Tools for Technology Transfer
Formal Methods in Verification
article

Approximate distributed monitoring under partial synchrony: balancing speed & accuracy

Borzoo Bonakdarpour, N. Ege Saraç, Anik Momtaz, Dejan Ničković
article en

Abstract

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.

International Journal on Software Tools for Technology Transfer
AIT Austrian Institute of Technology GmbH (AT), Helmholtz Center for Information Security (DE), Michigan State University (US)
National Science Foundation
Formal Methods in Verification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon