The paper considers the deterministic identifiability of interconnected complex systems composed of linear zero-memory elements. Algebraic identifiability criteria are first derived for cascade systems and then for general systems with individual system components linked via an interconnection matrix. It is shown that the identifiability of composite systems depends strongly on the structure of the system under consideration as well as on the inherent system parameters. Several illustrative examples are included.