The Application of Characteristic Polynomial Theory in Boolean Control Network

2018 ◽  
Vol 07 (03) ◽  
pp. 214-225
Author(s):  
向东 郭
Keyword(s):  
Characteristic Polynomial ◽  
Control Network ◽  
Boolean Control Network ◽  
Polynomial Theory

Characteristic polynomial theory of two-stage phase shifting algorithms

2012 ◽  
Vol 50 (4) ◽  
pp. 522-528 ◽  
Author(s):  
M. Miranda ◽  
B.V. Dorrío ◽  
J. Blanco ◽  
J. Diz-Bugarín ◽  
F. Ribas
Keyword(s):  
Characteristic Polynomial ◽  
Phase Shifting ◽  
Two Stage ◽  
Polynomial Theory

Implementation of Boolean Control Network Based Intelligent System in Smart Home

2016 ◽  
Vol 10 (3) ◽  
pp. 285-292
Author(s):  
M. Humayun Kabir ◽  
M. Robiul Hoque ◽  
Sung-Hyun Yang
Keyword(s):  
Smart Home ◽  
Intelligent System ◽  
Control Network ◽  
Boolean Control Network

Reachability and Controllability Analysis of Periodic Switched Boolean Control Networks

2014 ◽  
Vol 26 (5) ◽  
pp. 573-579 ◽  
Author(s):  
Zhiqiang Li ◽  
◽  
Jinli Song ◽  
Huimin Xiao
Keyword(s):  
Boolean Networks ◽  
Control Network ◽  
Discrete Time System ◽  
Vector Form ◽  
Time System ◽  
Control Networks ◽  
Boolean Control Network ◽  
Switching Signal ◽  
And Control ◽  
Periodic Switching

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 setCare obtained.

scholarly journals Conversion between Logic and Algebraic Expressions of Boolean Control Networks

2020 ◽  
Vol 10 (20) ◽  
pp. 7180
Author(s):  
Cailu Wang ◽  
Yuegang Tao
Keyword(s):  
Boolean Functions ◽  
Digital Circuits ◽  
Direct Conversion ◽  
Control Network ◽  
Numerical Examples ◽  
Control Networks ◽  
Analysis And Design ◽  
Boolean Control Network ◽  
Algebraic Expressions ◽  
Mutual Conversion

The conversion between logic and algebraic expressions of Boolean control networks plays a worthy role in the analysis and design of digital circuits. In this paper, for a single Boolean function, a direct conversion between the minterm canonical form and the structure matrix is provided. For a Boolean control network consisting of systems of Boolean functions, two algorithms are developed to achieve the mutual conversion between the logic and algebraic expressions. The presented algorithms decrease exponentially the complexity of the semi-tensor product based method. Some numerical examples are given to demonstrate the algorithms and to compare our method with the existing ones.

Sign in / Sign up

Export Citation Format

Share Document