Reachability and Controllability Analysis of Periodic Switched Boolean Control Networks | Zendy

Zhiqiang Li | Zendy; Jinli Song | Zendy; Huimin Xiao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Reachability and Controllability Analysis of Periodic Switched Boolean Control Networks

Author(s) -

Zhiqiang Li,

Jinli Song,

Huimin Xiao

Publication year - 2014

Publication title -

journal of robotics and mechatronics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.257

H-Index - 19

eISSN - 1883-8049

pISSN - 0915-3942

DOI - 10.20965/jrm.2014.p0573

Subject(s) - controllability , reachability , boolean network , and inverter graph , mathematics , product term , control theory (sociology) , boolean function , set (abstract data type) , computer science , topology (electrical circuits) , control (management) , boolean circuit , discrete mathematics , combinatorics , two element boolean algebra , pure mathematics , algebra over a field , artificial intelligence , programming language , filtered algebra

The reachability and controllability of switched Boolean (control) network are discussed in this paper. Based on semi-tensor product, using the vector form of Boolean logical variable, the switched Boolean (control) network is expressed as a discrete time system with state and control variables. For the switched Boolean network without control, the stabilization by suitable switching signal is discussed. Also, the controllability of the periodic switching signal is learned, and the conditions for stability and controllability of periodic switched Boolean networks avoiding states set C are obtained.

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