Open AccessTopological structure of implicit Boolean networks
Author(s) -
Yu Yongyuan,
Feng June,
Meng Min,
Wang Biao
Publication year - 2017
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.2016.1658
Subject(s) - algebraic structure , set (abstract data type) , topology (electrical circuits) , transformation (genetics) , algebraic number , boolean function , mathematics , boolean network , boolean algebra , computer science , theoretical computer science , discrete mathematics , pure mathematics , combinatorics , mathematical analysis , biochemistry , chemistry , gene , programming language
In this study, implicit Boolean networks (IBNs), which are more general than classic BNs, are proposed for the first time motivated by the river‐crossing decision problem. By resorting to the admissible set, some necessary and sufficient conditions are established, under which IBNs can be equivalently converted into classic BNs or restricted BNs. Subsequently, an improved approach is presented to determine the topological structure of dynamic‐algebraic BNs (D‐ABNs), based on which transformation relations between IBNs and D‐ABNs are given. Finally, a biochemical oscillator example is used to show the application of the obtained results.