Complete synchronization of temporal Boolean networks |
| |
| Affiliation: | 1. Research Center for Complex Systems and Network Science, School of Mathematics, Southeast University, Nanjing 210096, PR China;2. School of Information Engineering, Huzhou University, Huzhou 313000, PR China;3. Department of Mathematics, King Abdulaziz University, Jeddah 21589, Saudi Arabia;4. Nonlinear Analysis and Applied Mathematics (NAAM) Research Group, Department of Mathematics, King Abdulaziz University, Jeddah 21589, Saudi Arabia;5. Department of Electrical and Computer Engineering, Faculty of Engineering, King Abdulaziz University, Jeddah 21589, Saudi Arabia |
| |
| Abstract: | This letter studies complete synchronization of two temporal Boolean networks coupled in the drive-response configuration. Necessary and sufficient conditions are provided based on the algebraic representation of Boolean networks. Moreover, the upper bound to check the criterion is given. Finally, an illustrative example shows the efficiency of the proposed results. |
| |
| Keywords: | Temporal Boolean network Time delay Complete synchronization Semi-tensor product |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
