Visible to the public Biblio

Filters: Keyword is discrete event systems  [Clear All Filters]
2021-12-20
Zheng, Shengbao, Shu, Shaolong, Lin, Feng.  2021.  Modeling and Control of Discrete Event Systems under Joint Sensor-Actuator Cyber Attacks. 2021 6th International Conference on Automation, Control and Robotics Engineering (CACRE). :216–220.
In this paper, we investigate joint sensor-actuator cyber attacks in discrete event systems. We assume that attackers can attack some sensors and actuators at the same time by altering observations and control commands. Because of the nondeterminism in observation and control caused by cyber attacks, the behavior of the supervised systems becomes nondeterministic and deviates from the target. We define two bounds on languages, an upper-bound and a lower-bound, to describe the nondeterministic behavior. We then use the upper-bound language to investigate the safety supervisory control problem under cyber attacks. After introducing CA-controllability and CA-observability, we successfully solve the supervisory control problem under cyber attacks.
2021-02-08
Moormann, L., Mortel-Fronczak, J. M. van de, Fokkink, W. J., Rooda, J. E..  2020.  Exploiting Symmetry in Dependency Graphs for Model Reduction in Supervisor Synthesis. 2020 IEEE 16th International Conference on Automation Science and Engineering (CASE). :659–666.
Supervisor synthesis enables the design of supervisory controllers for large cyber-physical systems, with high guarantees for functionality and safety. The complexity of the synthesis problem, however, increases exponentially with the number of system components in the cyber-physical system and the number of models of this system, often resulting in lengthy or even unsolvable synthesis procedures. In this paper, a new method is proposed for reducing the model of the system before synthesis to decrease the required computational time and effort. The method consists of three steps for model reduction, that are mainly based on symmetry in dependency graphs of the system. Dependency graphs visualize the components in the system and the relations between these components. The proposed method is applied in a case study on the design of a supervisory controller for a road tunnel. In this case study, the model reduction steps are described, and results are shown on the effectiveness of model reduction in terms of model size and synthesis time.
2020-04-20
Lefebvre, Dimitri, Hadjicostis, Christoforos N..  2019.  Trajectory-observers of timed stochastic discrete event systems: Applications to privacy analysis. 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT). :1078–1083.
Various aspects of security and privacy in many application domains can be assessed based on proper analysis of successive measurements that are collected on a given system. This work is devoted to such issues in the context of timed stochastic Petri net models. We assume that certain events and part of the marking trajectories are observable to adversaries who aim to determine when the system is performing secret operations, such as time intervals during which the system is executing certain critical sequences of events (as captured, for instance, in language-based opacity formulations). The combined use of the k-step trajectory-observer and the Markov model of the stochastic Petri net leads to probabilistic indicators helpful for evaluating language-based opacity of the given system, related timing aspects, and possible strategies to improve them.
2020-01-13
Lin, Liyong, Thuijsman, Sander, Zhu, Yuting, Ware, Simon, Su, Rong, Reniers, Michel.  2019.  Synthesis of Supremal Successful Normal Actuator Attackers on Normal Supervisors. 2019 American Control Conference (ACC). :5614–5619.
In this paper, we propose and develop an actuator attack model for discrete-event systems. We assume the actuator attacker partially observes the execution of the closed-loop system and eavesdrops the control commands issued by the supervisor. The attacker can modify each control command on a specified subset of attackable events. The goal of the actuator attacker is to remain covert until it can establish a successful attack and lead the attacked closed-loop system into generating certain damaging strings. We then present a characterization for the existence of a successful attacker and prove the existence of the supremal successful attacker, when both the supervisor and the attacker are normal. Finally, we present an algorithm to synthesize the supremal successful normal attackers.
2018-02-15
Mhamdi, L., Njima, C. B., Dhouibi, H., Hassani, M..  2017.  Using timed automata and fuzzy logic for diagnosis of multiple faults in DES. 2017 International Conference on Control, Automation and Diagnosis (ICCAD). :457–463.

This paper proposes a design method of a support tool for detection and diagnosis of failures in discrete event systems (DES). The design of this diagnoser goes through three phases: an identification phase and finding paths and temporal parameters of the model describing the two modes of normal and faulty operation, a detection phase provided by the comparison and monitoring time operation and a location phase based on the combination of the temporal evolution of the parameters and thresholds exceeded technique. Our contribution lays in the application of this technique in the presence of faults arising simultaneously, sensors and actuators. The validation of the proposed approach is illustrated in a filling system through a simulation.