Decentralised Runtime Verification of Timed Regular Expressions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Decentralised Runtime Verification of Timed Regular Expressions


Ensuring the correctness of distributed cyber-physical systems can be done at runtime by monitoring properties over their behaviour. In a decentralised setting, such behaviour consists of multiple local traces, each offering an incomplete view of the system events to the local monitors, as opposed to the standard centralised setting with a unique global trace. We introduce the first monitoring framework for timed properties described by timed regular expressions over a distributed network of monitors. First, we define functions to rewrite expressions according to partial knowledge for both the centralised and decentralised cases. Then, we define decentralised algorithms for monitors to evaluate properties using these functions, as well as proofs of soundness and eventual completeness of said algorithms. Finally, we implement and evaluate our framework on synthetic timed regular expressions, giving insights on the cost of the centralised and decentralised settings and when to best use each of them.
Fichier principal
Vignette du fichier
time22.pdf (695.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03911668 , version 1 (23-12-2022)





Victor Roussanaly, Yliès Falcone. Decentralised Runtime Verification of Timed Regular Expressions. TIME 2022 - 29th International Symposium on Temporal Representation and Reasoning, Nov 2022, Online, France. pp.1-18, ⟨10.4230/LIPIcs..12⟩. ⟨hal-03911668⟩
38 View
11 Download



Gmail Facebook Twitter LinkedIn More