Identifiability in Dynamic Acyclic Networks With Partial Excitation and Measurement

This article deals with dynamic networks in which the causality relations between the vertex signals are represented by linear time-invariant transfer functions (modules). Considering an acyclic network where only a subset of its vertices are measured and a subset of the vertices are excited, we explore conditions under which all the modules are identifiable on the basis of measurement data. Two sufficient conditions are presented, where the first condition concerns an identifiability analysis that needs to be performed for each vertex, while the second condition, based on the concept of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">tree/antitree covering</i>, results from a graphical synthesis approach to allocate actuators and sensors in acyclic networks for achieving generic identifiability.