Efficient and Generalized Decentralized Monitoring of Regular Languages

Abstract : This paper proposes an efficient and generalized decentralized monitoring algorithm allowing to detect satisfaction or violation of any regular specification by local monitors alone in a system without central observation point. Our algorithm does not assume any form of synchronization between system events and communication of monitors, uses state machines as underlying mechanism for efficiency, and tries to keep the number and size of messages exchanged between monitors to a minimum. We provide a full implementation of the algorithm with an open-source benchmark to evaluate its efficiency in terms of number, size of exchanged messages, and delay induced by communication between monitors. Experimental results demonstrate the effectiveness of our algorithm which outperforms the previous most general one along several (new) monitoring metrics.
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00972559
Contributor : Yliès Falcone <>
Submitted on : Friday, April 4, 2014 - 7:28:40 AM
Last modification on : Thursday, October 11, 2018 - 8:48:02 AM
Document(s) archivé(s) le : Friday, July 4, 2014 - 10:41:23 AM

File

forte14.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Yliès Falcone, Tom Cornebize, Jean-Claude Fernandez. Efficient and Generalized Decentralized Monitoring of Regular Languages. 34th Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2014, Berlin, Germany. pp.66-83, ⟨10.1007/978-3-662-43613-4_5⟩. ⟨hal-00972559⟩

Share

Metrics

Record views

545

Files downloads

295