Pages: 5500-5506

The question addressed in this paper is to determine what is the input/output information that must be acquired in order to identify a network of dynamical systems, or part of such network. More specifically, which nodes must be excited and which nodes must be measured in order to render a network, or a given piece of a network, identifiable. We show that identification of a given set of edges requires that all nodes connected to these edges must be either excited or measured or both. We study in detail the identifiability of four types of edge sets: edges arriving at a given node, edges leaving a given node, edges forming a tree and edges forming a loop. For each case, we characterise excitation and measurement patterns that provide identifiability.