Runtime enforcement of timed properties usinggames
Author(s) -
Matthieu Renard,
Antoine Rollet,
Ylìès Falcone
Publication year - 2020
Publication title -
formal aspects of computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 42
eISSN - 1433-299X
pISSN - 0934-5043
DOI - 10.1007/s00165-020-00515-2
Subject(s) - computer science , enforcement , correctness , automaton , theory of computation , runtime verification , distributed computing , programming language , property (philosophy) , mechanism (biology) , theoretical computer science , formal verification , philosophy , epistemology , political science , law
This paper deals with runtime enforcement of timed properties with uncontrollable events. Runtime enforcement consists in defining and using an enforcement mechanism that modifies the executions of a running system to ensure their correctness with respect to the desired property. Uncontrollable events cannot be modified by the enforcement mechanisms and thus have to be released immediately. We present a complete theoretical framework for synthesising such mechanism, modelling the runtime enforcement problem as a Büchi game. It permits to pre-compute the decisions of the enforcement mechanism, thus avoiding to explore the whole execution tree at runtime. The obtained enforcement mechanism is sound, compliant and optimal, meaning that it should output as soon as possible correct executions that are as close as possible to the input execution. This framework takes as input any timed regular property modelled by a timed automaton. We present GREP, a tool implementing this approach. We provide algorithms and implementation details of the different modules of GREP, and evaluate its performance. The results are compared with another state of the art runtime enforcement tool.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom