期刊
AUTOMATICA
卷 128, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2021.109605
关键词
Discrete event system; Petri net; Timed event graphs; Performance safety
资金
- National Natural Science Foundation of China [61703321, 61803246, 62073206]
- China Postdoctoral Science Foundation [2019M663608]
- Shaanxi Provincial Natural Science Foundation, China [2019JQ-022, 2020JQ733]
- Fundamental Research Funds for the Central Universities, China [JB190407, JB210413]
This paper addresses the performance safety enforcing problem in plants modeled by timed event graphs, proposing two approaches for designing transition protecting policies under different scenarios.
In this paper, we tackle the performance safety enforcing problem in plants modeled by timed event graphs that are a subclass of timed Petri nets. We assume that a malicious intruder can increase the firing delay of transitions by adding delay in communication, or corrupt the transmitted data. Our target is to design a transition protecting policy to guarantee that the global performance does not drop below a given lower-bound threshold. Two classes of situations are considered: (1) the operator does not know the capability of the intruder, which means that all possible attacks must be taken into account; (2) the operator knows the upper bound of the capability of the intruder, e.g., the maximal number of transitions that can be simultaneously attacked. For the former case, we develop an algorithm using mixed integer linear programming to obtain an optimal protecting policy. For the latter situation, we develop a heuristic method to compute a protecting policy that is locally optimal. (C) 2021 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据