Synthesis of Maximally-Permissive Supervisors for the Range Control Problem

Yin, Xiang; Lafortune, Stéphane

doi:10.1109/tac.2016.2644867

Cited by 47 publications

(11 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on Constraints (12), (13) and (14), Constraints (15) are used to ensure L(G 1 ) ⊆ L(S G). Let φ S T le f t denote the resultant formula after combining Constraints (11), (12), (13), (14) and (15).…”

Section: Bounded Resilient Supervisor Synthesismentioning

confidence: 99%

Towards Bounded Synthesis of Resilient Supervisors

Lin

Zhu

2019

2019 IEEE 58th Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

In this work, we study the safety approach of synthesizing resilient supervisors against actuator attacks, for cyber-physical systems that can be modeled as discrete-event systems. A constraint based approach for the bounded synthesis of resilient supervisors is developed. The supervisor obfuscation problem, which is proposed in a specific setting of actuator attack, can be naturally modelled and solved using the same approach.

show abstract

Section: Bounded Resilient Supervisor Synthesismentioning

confidence: 99%

Towards Bounded Synthesis of Resilient Supervisors

Lin

Zhu

2019

2019 IEEE 58th Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

show abstract

“…In [88], the authors studied the problem of synthesizing supervisors that enforce detectability. A uniform approach for control synthesis for enforcing a wide class of properties was recently proposed by Yin and Lafortune in a series of papers [119,120,123,126].…”

Section: Control Synthesis Of Partially-observed Desmentioning

confidence: 99%

Estimation and Verification of Partially Observed Discrete‐Event Systems

Yin

2019

Wiley Encyclopedia of Electrical and Electronics Engineering

Self Cite

View full text Add to dashboard Cite

State estimation is one of the most fundamental problems in the systems and control theory. In many real-world systems, it is not always possible to access the full information of the system due to measurement noises/uncertainties and the existence of adversaries. Therefore, how to estimate the state of the system is crucial when one wants to make decisions based on the limited and incomplete information.Given a system, one of the most important questions is to prove/disprove the correctness of the system with respect to some desired requirement (or specification). In particular, we would like to check the correctness of the system in a formal manner in the sense that the checking procedures are algorithmic and results have provable correctness guarantees. Such a formal satisfaction checking problem is referred to as the verification problem. Performing formal property verification is very important for many complicated but safety-critical infrastructures.This article considers state estimation and verification problems for an important class of man-made cyber-physical systems called Discrete-Event Systems (DES). Roughly speaking, DES are dynamic systems with discrete state-spaces and event-triggered dynamics. DES models are widely used in the study of complex automated systems where the behavior is inherently eventdriven, as well as in the study of discrete abstractions of continuous, hybrid, and/or cyber-physical systems. Over the past decades, the theory of DES has been successfully applied to many real-world problems, e.g., the control of

show abstract

“…(3) The solution methodology of this work is to model the networked supervisor synthesis problem as the (non-networked) supervisor synthesis problem (for non-deterministic plants). This allows us to employ the existing non-networked supervisor synthesis algorithms to deal with the supervisor synthesis problem for networked systems when facing other kinds of specifications, such as the range control specification [23], without the need to invent new synthesis algorithms (cf. [7]).…”

Section: Introductionmentioning

confidence: 99%

Networked Supervisor Synthesis Against Lossy Channels with Bounded Network Delays as Non-Networked Synthesis

Lin¹,

Zhu²,

Tai³

et al. 2021

Preprint

View full text Add to dashboard Cite

In this work, we study the problem of supervisory control of networked discrete event systems. We consider lossy communication channels with bounded network delays, for both the control channel and the observation channel. By a model transformation, we transform the networked supervisor synthesis problem into the classical (non-networked) supervisor synthesis problem (for non-deterministic plants), such that the existing supervisor synthesis tools can be used for synthesizing networked supervisors. In particular, we can use the (state-based) normality property for the synthesis of the supremal networked supervisors, whose existence is guaranteed by construction due to our consideration of command non-deterministic supervisors. The effectiveness of our approach is illustrated on a mini-guideway example that is adapted from the literature, for which the supremal networked supervisor has been synthesized in the synthesis tools SuSyNA and TCT.

show abstract

Synthesis of Maximally-Permissive Supervisors for the Range Control Problem

Cited by 47 publications

References 28 publications

Towards Bounded Synthesis of Resilient Supervisors

Towards Bounded Synthesis of Resilient Supervisors

Estimation and Verification of Partially Observed Discrete‐Event Systems

Networked Supervisor Synthesis Against Lossy Channels with Bounded Network Delays as Non-Networked Synthesis

Contact Info

Product

Resources

About