Stream Runtime Verification (SRV) is a behavioral specification language for runtime verification, where a monitor is described by expressing the dependencies between the output streams of values in terms of the input streams of observations. SRV is based on the observation that many monitoring algorithms can be generalized from Booleans to rich data domains. Stream runtime verification provides a friendly language (with a programming look and feel) to express these dependencies and automatically generate monitors that compute the specification. Also, SRV benefits from simplifiers that rewrite expressions maintaining term equivalence.

In this presentation I will introduce how to extend SRV for a decentralized setting. The proposed algorithm is suitable for arbitrary connected topologies where a global clock or a synchronization mechanism can be assumed. I will also present advanced communication strategies that help tailoring the resource consumption of the algorithm to the task at hand.

Finally I will present empirical results that confirm the adequacy of this approach.