no code implementations • 21 Nov 2023 • Lele Li, Liyong Lin
Moreover, a Monte-Carlo tree search based soft shielding component is developed to help address long-sequence dependent unsafe behaviors and monitor the risk of overdue scheduling.
no code implementations • 29 Jul 2023 • Ruochen Tai, Liyong Lin, Rong Su
We also discuss how to extend the decidability result to the case against the worst-case attacker.
no code implementations • 5 May 2022 • Ruochen Tai, Liyong Lin, Rong Su
This work investigates the problem of synthesizing obfuscated supervisors against covert actuator attackers.
no code implementations • 16 Mar 2022 • Ruochen Tai, Liyong Lin, Yuting Zhu, Rong Su
In this paper, we consider the problem of synthesizing the supremal covert damage-reachable attacker, in the setup where the model of the supervisor is unknown to the adversary but the adversary has recorded a (prefix-closed) finite set of observations of the runs of the closed-loop system.
no code implementations • 25 Jan 2022 • Ruochen Tai, Liyong Lin, Rong Su
In this work, we investigate how to make use of model reduction techniques to identify the vulnerability of a closed-loop system, consisting of a plant and a supervisor, that might invite attacks.
no code implementations • 23 Jun 2021 • Ruochen Tai, Liyong Lin, Yuting Zhu, Rong Su
In this paper, we consider the problem of synthesis of maximally permissive covert damage-reachable attackers in the setup where the model of the supervisor is unknown to the adversary but the adversary has recorded a (prefix-closed) finite set of observations of the runs of the closed-loop system.
no code implementations • 30 Apr 2021 • Ruochen Tai, Liyong Lin, Yuting Zhu, Rong Su
Our approach is to model the co-synthesis problem as a distributed supervisor synthesis problem in the Ramadge-Wonham supervisory control framework, and we propose an incremental synthesis heuristic to incrementally synthesize a dynamic mask, an edit function, and a supervisor, which consists of three steps: 1) we first synthesize an ensemble ME of dynamic mask and edit function to ensure the opacity and the covertness against a sensor eavesdropping but command non-eavesdropping intruder, and marker-reachability; 2) we then decompose ME into a dynamic mask and an edit function by using a constraint-based approach, with the help of a Boolean satisfiability (SAT) solver; 3) finally, we synthesize a supervisor such that opacity and covertness can be ensured against the sensor-actuator eavesdropping intruder, and at the same time safety and nonblockingness requirement can be ensured.
no code implementations • 9 Apr 2021 • Ruochen Tai, Liyong Lin, Yuting Zhu, Rong Su
We focus on the class of edit functions that satisfy the following properties: 1) the observation capability of the edit function in general can be different from those of the supervisor and the intruder; 2) the edit function can implement insertion, deletion, and replacement operations; 3) the edit function performs bounded edit operations, i. e., the length of each string output of the edit function is upper bounded by a given constant.
no code implementations • 21 Mar 2021 • Liyong Lin, Yuting Zhu, Ruochen Tai, Simon Ware, Rong Su
In this work, we study the problem of supervisory control of networked discrete event systems.
no code implementations • 20 Mar 2021 • Liyong Lin, Ruochen Tai, Yuting Zhu, Rong Su
In this work, we address the problem of synthesis of covert attackers in the setup where the model of the plant is available, but the model of the supervisor is unknown, to the adversary.
1 code implementation • 29 Mar 2018 • Liyong Lin, Tomáš Masopust, W. Murray Wonham, Rong Su
A (partial) solution to this problem is provided, which consists of 1) an incremental algorithm for the production of candidate reductions and 2) a reduction validation procedure.
Systems and Control Formal Languages and Automata Theory Optimization and Control