Excitation allocation for generic identifiability of a single module in dynamic networks: A graphic approach

For identifiability of a single module in a dynamic network, excitation signals need to be allocated at particular nodes in the network. Current techniques provide analysis tools for verifying identifiability in a given situation, but hardly address the synthesis question: where to allocate the excitation signals to achieve generic identifiability. Starting from the graph topology of the considered network model set, a new analytic result for generic identifiability of a single module is derived based on the concept of disconnecting sets. For the situation that all node signals are measured, the vertices in a particular disconnecting set provide the potential locations to allocate the excitation signals. Synthesis approaches are then developed to allocate excitation signals to guarantee generic identifiability.