Decentralized LTL Enforcement
Abstract
We consider the runtime enforcement of Lineartime Temporal Logic formulas on decentralized systems with no central observation point nor authority. A socalled enforcer is attached to each system component and observes its local trace. Should the global trace violate the specification, the enforcers coordinate to correct their local traces. We formalize the decentralized runtime enforcement problem and define the expected properties of enforcers, namely soundness, transparency and optimality. We present two enforcement algorithms. In the first one, the enforcers explore all possible local modifications to find the best global correction. Although this guarantees an optimal correction, it forces the system to synchronize and is more costly, computation and communication wise. In the second one, each enforcer makes a local correction before communicating. The reduced cost of this version comes at the price of the optimality of the enforcer corrections.
 Publication:

arXiv eprints
 Pub Date:
 July 2021
 arXiv:
 arXiv:2107.06084
 Bibcode:
 2021arXiv210706084G
 Keywords:

 Computer Science  Logic in Computer Science;
 Computer Science  Formal Languages and Automata Theory
 EPrint:
 In Proceedings GandALF 2021, arXiv:2109.07798