Skip to main content

Decentralized Asynchronous Crash-Resilient Runtime Verification

Publication Type
Year of Publication
Conference/Journal Name
International Conference on Concurrency Theory (CONCUR)
Runtime Verification (RV) is a lightweight method for monitoring the formal specification of a system during its execution. It has recently been shown that a given state predicate can be monitored consistently by a set of crash-prone asynchronous distributed monitors, only if
sufficiently many different verdicts can be emitted by each monitor. We revisit this impossibility result in the context of LTL semantics for RV. We show that employing the four-valued logic RV-LTL will result in inconsistent distributed monitoring for some formulas. Our first main contribution is a family of logics, called LTL2k+4, that refines RV-LTL incorporating 2k + 4 truth values, for each k ≥ 0. The truth values of LTL2k+4 can be effectively used by each monitor to reach a consistent global set of verdicts for each given formula, provided k is sufficiently large. Our second main contribution is an algorithm for monitor construction enabling fault-tolerant distributed monitoring based on the aggregation of the individual verdicts by each monitor.