Distinguishability of the descriptor systems with regular pencil (Q2168913)

The authors consider a linear hybrid descriptor system and focus on the property that the distinguishability of this type of systems is imperative. The paper contains two results. The first result is related to the distinguishability of the descriptor system under study, for which some criteria and equivalent conditions related to polynomial input distinguishability, analytic and smooth input distinguishability are developed. The second result concerns equivalent criteria for input distinguishability of descriptor systems with a regular pencil by using the Laplace transform and the Cayley-Hamilton theorem.