Structural Controllability of Boolean Control Networks under Partial Information | Zendy

Qinyao Pan | Zendy; Jie Zhong | Zendy; Shalin Tong | Zendy; Bowen Li | Zendy; Xiaoxu Liu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Structural Controllability of Boolean Control Networks under Partial Information

Author(s) -

Qinyao Pan,

Jie Zhong,

Shalin Tong,

Bowen Li,

Xiaoxu Liu

Publication year - 2021

Publication title -

complexity

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.447

H-Index - 61

eISSN - 1099-0526

pISSN - 1076-2787

DOI - 10.1155/2021/9442358

Subject(s) - controllability , boolean network , computer science , and inverter graph , theoretical computer science , state (computer science) , control (management) , product (mathematics) , boolean function , boolean algebra , tensor product , mathematics , boolean expression , algorithm , pure mathematics , artificial intelligence , geometry

It is worth noting that both nodes’ coupling connections and logical updating functions play a vital role in state evolutions of Boolean networks (BNs). In this paper, a new concept named structural controllability (SC) about Boolean control networks (BCNs) with known partial information on nodes’ connections is studied. Then, by referring to semi-tensor product (STP) techniques, several types of SC are presented according to different issues of Boolean functions. Thereafter, several necessary and sufficient conditions are derived for SC of BCNs. Finally, a biological model of the lactose operon in Escherichia coli is simulated to show the effectiveness of the main theoretical results.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research