Identification of Boolean control networks

• Published in: Automatica (Oxford) Vol. 47; no. 4; pp. 702 - 710
• Main Authors: Cheng, Daizhan, Zhao, Yin
• Format: Journal Article
• Language: English
• Published: Kidlington Elsevier Ltd 01.04.2011; Elsevier
• Subjects: Applied sciences; Approximation; Automata. Abstract machines. Turing machines; Boolean algebra; Boolean control network; Computer science; control theory; systems; Control system analysis; Control theory. Systems; Controllability; Exact sciences and technology; Graphs; Identification; Information retrieval. Graph; Mathematical analysis; Mathematical models; Modelling and identification; Network graph; Networks; Numerical analysis; Observability; Stability; Theoretical computing; Controllability; Identification; Network graph; Observability; Boolean control network; Input output; Necessary and sufficient condition; Boolean Network; Modeling; Observable; Equations of state; Boolean logic; System identification; State estimation; Numerical algorithm
• ISSN: 0005-1098; 1873-2836
• DOI: 10.1016/j.automatica.2011.01.083

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.