Structure Identifiability of an NDS With LFT Parametrized Subsystems

Requirements on subsystems have been made clear in this article for a linear time invariant networked dynamic system (NDS), under which subsystem interconnections can be estimated from external output measurements. In this NDS, subsystems may have distinctive dynamics, and subsystem interconnections are arbitrary. It is assumed that system matrices of each subsystem depend on its (pseudo) first principle parameters (FPP) through a linear fractional transformation. It has been proven that if in each subsystem, the transfer function matrix (TFM) from its internal inputs to its external outputs is of full normal column rank, while the TFM from its external inputs to its internal outputs is of full normal row rank, then the structure of the NDS is identifiable. Moreover, under some particular situations like there is no direct information transmission from an internal input to an internal output in each subsystem, a necessary and sufficient condition is established for NDS structure identifiability. A matrix valued polynomial rank-based equivalent condition is further derived, which depends affinely on subsystem (pseudo) FPPs and can be independently verified for each subsystem. From this condition, some necessary conditions are obtained for both subsystem dynamics and its (pseudo) FPPs, using the Kronecker canonical form of a matrix pencil.