Performance safety enforcement in stochastic event graphs against boost and slow attacks

This paper studies a performance safety enforcing problem in stochastic event graphs, a subclass of stochastic Petri net models. We assume that an intruder can attack part of the transitions to increase/decrease their firing rate such that the performance of the system violates a given safety interval. The difficulty in solving this problem is that the capability of the intruder, i.e., the number of transitions that can be simultaneously attacked, is limited. The control aim is to find a protecting policy such that the performance of the protected plant is guaranteed to be in a given safety interval. We show that this problem can be formulated as a two-player game between the intruder and the operator of the plant. By using mixed integer linear programming technique, we develop a heuristic method to compute a protecting policy that is locally optimal.