License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TIME.2023.6
URN: urn:nbn:de:0030-drops-190962
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/19096/
Shankar, Saumya ;
Pinisetty, Srinivas ;
Jéron, Thierry
Bounded-Memory Runtime Enforcement of Timed Properties
Abstract
Runtime Enforcement (RE) is a monitoring technique aimed at correcting possibly incorrect executions w.r.t. a set of formal requirements (properties) of a system. In this paper, we consider enforcement monitoring of real-time properties. Thus, executions are modelled as timed words and specifications as timed automata. Moreover, we consider that the enforcer has the ability to delay events by storing or buffering them into its internal memory (and releasing them when the property is finally satisfied) and suppressing events when no delaying is appropriate. Practically, in an implementation, the internal memory of the enforcer is finite.
In this paper, we propose a new RE paradigm for timed properties, where the memory of the enforcer is bounded/finite, to address practical applications with memory constraints and timed specifications. Bounding the memory presents a number of difficulties, e.g., how to accommodate a timed event into the memory when the memory is full, s.t., regardless of the course of action we choose to handle this situation, the behaviour of the bounded enforcer should not significantly differ from that of the unbounded enforcer. The problem of how to optimally discard events when the buffer is full is significantly more difficult in a timed environment where the progress of time affects the satisfaction or violation of a property. We define the bounded-memory RE problem for timed properties and develop a framework for regular timed properties specified as timed automata. The proposed framework is implemented in Python, and its performance is evaluated. From experiments, we discovered that the enforcer has a reasonable execution time overhead.
BibTeX - Entry
@InProceedings{shankar_et_al:LIPIcs.TIME.2023.6,
author = {Shankar, Saumya and Pinisetty, Srinivas and J\'{e}ron, Thierry},
title = {{Bounded-Memory Runtime Enforcement of Timed Properties}},
booktitle = {30th International Symposium on Temporal Representation and Reasoning (TIME 2023)},
pages = {6:1--6:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-298-3},
ISSN = {1868-8969},
year = {2023},
volume = {278},
editor = {Artikis, Alexander and Bruse, Florian and Hunsberger, Luke},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/19096},
URN = {urn:nbn:de:0030-drops-190962},
doi = {10.4230/LIPIcs.TIME.2023.6},
annote = {Keywords: Formal methods, Runtime enforcement, Bounded-memory, Timed automata}
}
|
Keywords: |
|
Formal methods, Runtime enforcement, Bounded-memory, Timed automata |
|
Collection: |
|
30th International Symposium on Temporal Representation and Reasoning (TIME 2023) |
|
Issue Date: |
|
2023 |
|
Date of publication: |
|
18.09.2023 |
