Decentralised Runtime Verification of Timed Regular Expressions
Résumé
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.
Mots clés
2012 ACM Subject Classification Theory of computation → Distributed computing models Theory of computation → Regular languages Theory of computation → Rewrite systems Theory of computation → Automata over infinite objects Computer systems organization → Real-time system specification phrases Timed expressions
Timed properties
Monitoring
Runtime verification
Decentralized systems
Asynchronous communication Digital Object Identifier 10.4230/LIPIcs...12
2012 ACM Subject Classification Theory of computation → Distributed computing models
Theory of computation → Regular languages
Theory of computation → Rewrite systems
Theory of computation → Automata over infinite objects
Computer systems organization → Real-time system specification phrases Timed expressions
Origine | Fichiers produits par l'(les) auteur(s) |
---|