This paper gives an equivalent condition for the observability of Boolean control networks (BCNs) with time-variant delays in states under a mild assumption by using the graph-theoretic method under the framework of the semi-tensor product of matrices. First, the BCN under consideration is split into a finite number of subsystems with no time delays. Second, the observability of the BCN is verified by testing the observability of the so-called observability constructed path (a special subsystem without time delays) based on graph theory. These results extend the recent related results on the observability of BCNs. Examples are shown to illustrate the effectiveness of the results.

EB00000003612K

Available