Abstract
This article aims to provide the equivalent criteria for the distinguishability of linear descriptor systems (LDS). Regularity of the matrix pencil, which, loosely speaking, guarantees the existence, and uniqueness of the solution of LDS for any inhomogeneity, is required in this article. A characterization of observability for LDS in terms of distinguishability is given. The Laplace transform together with the Cayley-Hamilton theorem exploited to derive Hautus-type criteria for the distinguishability. In addition, we present examples of distinguishable systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
