TY - JOUR
T1 - Formal Control Synthesis via Simulation Relations and Behavioral Theory for Discrete-Time Descriptor Systems
AU - Haesaert, Sofie
AU - Chen, Fei
AU - Abate, Alessandro
AU - Weiland, Siep
N1 - Publisher Copyright:
© 1963-2012 IEEE.
PY - 2021/3
Y1 - 2021/3
N2 - The control and verification of industrial processes, modeled as discrete-time descriptor systems, is often computationally hard due to the presence of both algebraic couplings and difference equations. In this article, we introduce a new control synthesis method for descriptor systems which is based on formal abstractions and enables control design over related reduced-order models. We leverage notions of exact and approximate similarity relations, which hold for the algebraic couplings that are inherent to descriptor systems. Using the behavioral framework, we extend a control refinement scheme for classical dynamical systems and develop a corresponding notion for descriptor systems: We show that any given well-posed controller of the abstract (reduced-order) descriptor system can be refined to a controller for the original descriptor system. The resulting controlled system preserves the same controlled output behavior in the case of exact similarity, whereas in the case of approximate similarity, the output behavior of the controlled descriptor system is shown to have a bounded deviation from that of the abstract model where the controller is designed.
AB - The control and verification of industrial processes, modeled as discrete-time descriptor systems, is often computationally hard due to the presence of both algebraic couplings and difference equations. In this article, we introduce a new control synthesis method for descriptor systems which is based on formal abstractions and enables control design over related reduced-order models. We leverage notions of exact and approximate similarity relations, which hold for the algebraic couplings that are inherent to descriptor systems. Using the behavioral framework, we extend a control refinement scheme for classical dynamical systems and develop a corresponding notion for descriptor systems: We show that any given well-posed controller of the abstract (reduced-order) descriptor system can be refined to a controller for the original descriptor system. The resulting controlled system preserves the same controlled output behavior in the case of exact similarity, whereas in the case of approximate similarity, the output behavior of the controlled descriptor system is shown to have a bounded deviation from that of the abstract model where the controller is designed.
KW - Approximate simulation relations
KW - behavioral theory
KW - descriptor systems (DS)
KW - formal verification
UR - http://www.scopus.com/inward/record.url?scp=85102028155&partnerID=8YFLogxK
U2 - 10.1109/TAC.2020.2992443
DO - 10.1109/TAC.2020.2992443
M3 - Article
AN - SCOPUS:85102028155
SN - 0018-9286
VL - 66
SP - 1024
EP - 1039
JO - IEEE Transactions on Automatic Control
JF - IEEE Transactions on Automatic Control
IS - 3
M1 - 9086161
ER -