FLSEDec 15, 2016

Runtime enforcement of reactive systems using synchronous enforcers

arXiv:1612.05030v127 citations
Originality Incremental advance
AI Analysis

This work addresses the problem of ensuring safety properties in synchronous reactive systems, which is incremental as it builds on existing runtime enforcement techniques.

The paper tackles runtime enforcement for safety-critical reactive systems by proposing a synchronous enforcer framework that monitors and minimally edits inputs/outputs to guarantee desired properties, with experimental results showing minimal execution time overhead that decreases with larger benchmarks.

Synchronous programming is a paradigm of choice for the design of safety-critical reactive systems. Runtime enforcement is a technique to ensure that the output of a black-box system satisfies some desired properties. This paper deals with the problem of runtime enforcement in the context of synchronous programs. We propose a framework where an enforcer monitors both the inputs and the outputs of a synchronous program and (minimally) edits erroneous inputs/outputs in order to guarantee that a given property holds. We define enforceability conditions, develop an online enforcement algorithm, and prove its correctness. We also report on an implementation of the algorithm on top of the KIELER framework for the SCCharts synchronous language. Experimental results show that enforcement has minimal execution time overhead, which decreases proportionally with larger benchmarks.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes