Efficient and Generalized Decentralized Monitoring of Regular Languages - Formal Techniques for Distributed Objects, Components, and Systems Access content directly
Conference Papers Year : 2014

Efficient and Generalized Decentralized Monitoring of Regular Languages

Yliès Falcone
Tom Cornebize
Jean-Claude Fernandez
  • Function : Author
  • PersonId : 858857


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.
Fichier principal
Vignette du fichier
forte14.pdf (203.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00972559 , version 1 (04-04-2014)





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⟩
400 View
300 Download



Gmail Facebook X LinkedIn More