Predictive runtime enforcement

Srinivas Pinisetty, Thierry Jéron, Viorel Preoteasa, Yliès Falcone, Stavros Tripakis, Hervé Marchand

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

4 Citations (Scopus)


Runtime enforcement (RE) is a technique to ensure that the (untrustworthy) output of a black-box system satisfies some desired properties. In RE, the output of the running system, modeled as a stream of events, is fed into an enforcement monitor. The monitor ensures that the stream complies with a certain property, by delaying or modifying events if necessary. This paper deals with predictive runtime enforcement, where the system is not entirely black-box, but we know something about its behavior. This a-priori knowledge about the system allows to output some events immediately, instead of delaying them until more events are observed, or even blocking them permanently. This in turn results in better enforcement policies. We also show that if we have no knowledge about the system, then the proposed enforcement mechanism reduces to a classical non-predictive RE framework. All our results are formalized and proved in the Isabelle theorem prover.

Original languageEnglish
Title of host publication2016 Symposium on Applied Computing, SAC 2016
Number of pages6
ISBN (Electronic)9781450337397
Publication statusPublished - 4 Apr 2016
MoE publication typeA4 Conference publication
EventACM Symposium On Applied Computing
- Pisa, Italy
Duration: 4 Apr 20168 Apr 2016
Conference number: 31


ConferenceACM Symposium On Applied Computing
Abbreviated titleSAC


  • Automata
  • Monitor synthesis
  • Monitoring
  • Runtime enforcement


Dive into the research topics of 'Predictive runtime enforcement'. Together they form a unique fingerprint.

Cite this