.png){kind=icon}
.png){kind=icon}
Return
Complete Synchronization of Boolean Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2012.2190094.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We examine complete synchronization of two deterministic Boolean networks (BNs) coupled unidirectionally in the drive-response configuration. A necessary and sufficient criterion is presented in terms of algebraic representations of BNs. As a consequence, we show that complete synchronization can occur only between two conditionally identical BNs when the transition matrix of the drive network is nonsingular. Two examples are worked out to illustrate the obtained results.
Keywords:
Boolean networks
complete synchronization
nonsingularity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
7.5K
Citations:
7.2W