Synchronization of Arbitrarily Switched Boolean Networks. Academic Article

abstract

• This paper investigates the complete synchronization problem for the drive-response switched Boolean networks (SBNs) under arbitrary switching signals, where the switching signals of the response SBN follow those generated by the drive SBN at each time instant. First, the definition of complete synchronization is introduced for the drive-response SBNs under arbitrary switching signals. Second, the concept of switching reachable set starting from a given initial state set is put forward. Based on it, a necessary and sufficient condition is derived for the complete synchronization of the drive-response SBNs. Last, we give a simple algebraic expression for the switching reachable set in a given number of time steps, and two computable algebraic criteria are obtained for the complete synchronization of the SBNs. A biological example is given to demonstrate the effectiveness of the obtained main results.

authors

• Huang, Tingwen

published proceedings

• IEEE Trans Neural Netw Learn Syst

author list (cited authors)

• Chen, H., Liang, J., Huang, T., & Cao, J.

citation count

• 53

complete list of authors

• Chen, Hongwei||Liang, Jinling||Huang, Tingwen||Cao, Jinde

publication date

• March 2017

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Transactions on Neural Networks and Learning Systems  Journal

keywords

• Complete Synchronization
• Semitensor Product (stp)
• Switched Boolean Networks (sbns)
• Switching Reachable Set

Digital Object Identifier (DOI)

• 10.1109/TNNLS.2015.2497708

start page

• 612

end page

• 619

volume

• 28

issue

• 3

URL

• http://dx.doi.org/10.1109/tnnls.2015.2497708