Abstract
In this paper, the synchronization of coupled Boolean networks with asynchronous update scheme is investigated. First, the asynchronous Boolean dynamics is transformed into a linear expression with the semi-tensor product technique. Then, the synchronization cycle is proposed to establish the synchronization conditions of asynchronous Boolean networks. Furthermore, an algorithm is given, which can be used to quickly check whether there exists the synchronization cycle in the coefficient matrix of the Boolean function. Finally, an example is provided to verify the efficiency of the theoretical analysis.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
