Open AccessSynchronisation analysis of Boolean networks based on equivalence
Author(s) -
Chen Hongwei,
Liang Jinling,
Liu Yang,
Huang Tingwen
Publication year - 2015
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2015.0311
Subject(s) - equivalence (formal languages) , boolean function , upper and lower bounds , boolean network , control theory (sociology) , and inverter graph , computer science , mathematics , topology (electrical circuits) , theoretical computer science , boolean expression , discrete mathematics , artificial intelligence , control (management) , combinatorics , mathematical analysis
This study studies the synchronisation of two Boolean networks (BNs) coupled in the drive‐response configuration, and presents a number of new results. A new indicator variable, which plays an important role in characterising the synchronised nodes between the drive BN and the response BN, is defined by coordinate equivalence. Consequently, some necessary and sufficient conditions are derived for the general synchronisation of the drive‐response BNs. Moreover, the upper bound of time to check the criterion is given. Two examples are provided to illustrate the efficiency of the obtained results.