Identification of Boolean control networks

In this paper the identification of Boolean control networks is addressed. First, necessary and sufficient conditions are obtained for the identification of state equation from input-state data. Then a necessary and sufficient condition for a controllable Boolean network to be observable is presented. Based on these two results, a necessary and sufficient condition for the identification from input–output data is achieved. To practically identify the model, a numerical algorithm is proposed. Two particular cases: (i) identification of systems with a known network graph; (ii) identification of a higher order Boolean network, are also investigated. Finally, the approximate identification for large size networks is explored.