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 Chaos and control of a three-dimensional fractional order discrete-time system with no equilibrium and its synchronization

AIP Advances ◽  
2020 ◽  
Vol 10 (4) ◽  
pp. 045310 ◽  
Author(s):  
Adel Ouannas ◽  
Amina Aicha Khennaoui ◽  
Shaher Momani ◽  
Giuseppe Grassi ◽  
Viet-Thanh Pham
Keyword(s):  
Fractional Order ◽  
Discrete Time ◽  
Three Dimensional ◽  
Discrete Time System ◽  
Time System ◽  
And Control

scholarly journals A Note on the Observability of Temporal Boolean Control Network

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Wenping Shi ◽  
Bo Wu ◽  
Jing Han
Keyword(s):  
Boolean Network ◽  
Sufficient Conditions ◽  
Boolean Networks ◽  
Control Networks ◽  
Linear Dynamic Systems ◽  
Regulatory Interactions ◽  
Boolean Control Network ◽  
Boolean Network Model ◽  
Necessary And Sufficient ◽  
Product Of Matrices

Temporal Boolean network is a generalization of the Boolean network model that takes into account the time series nature of the data and tries to incorporate into the model the possible existence of delayed regulatory interactions among genes. This paper investigates the observability problem of temporal Boolean control networks. Using the semi tensor product of matrices, the temporal Boolean networks can be converted into discrete time linear dynamic systems with time delays. Then, necessary and sufficient conditions on the observability via two kinds of inputs are obtained. An example is given to illustrate the effectiveness of the obtained results.

scholarly journals Influential Node Identification in Command and Control Networks Based on Integral k-Shell

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Yunming Wang ◽  
Bo Chen ◽  
Weidong Li ◽  
Duoping Zhang
Keyword(s):  
Network Performance ◽  
Simulation Analysis ◽  
Command And Control ◽  
Control Network ◽  
Control Networks ◽  
Influential Nodes ◽  
Influential Node ◽  
And Control ◽  
Global And Local ◽  
The Impact

Influential nodes act as a hub for information transmission in a command and control network. The identification of influential nodes in a network of this nature is a significant and challenging task; however, it is necessary if the invulnerability of the network is to be increased. The existing k-shell method is problematic in that it features a coarse sorting granularity and does not consider the local centrality of nodes. Thus, the degree of accuracy with which the influential nodes can be identified is relatively low. This motivates us to propose a method based on an integral k-shell to identify the influential nodes in a command and control network. This new method takes both the global and local information of nodes into account, introduces the historical k-shell and a 2-order neighboring degree, and refines the k-shell decomposition process in a network. Simulation analysis is carried out from two perspectives: to determine the impact on network performance when influential nodes are removed and to obtain the correlation between the integral k-shell value and its propagation value. The simulation results show that the integral k-shell method, which employs an algorithm of lower complexity, accurately identifies the influence of those nodes with the same k-shell values. Furthermore, the method significantly improves the accuracy with which the influential nodes can be identified.

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.

A New Method for Discrete-Time System Reduction

1988 ◽  
Author(s):  
Ioannis S. Apostolakis ◽  
John Diamessis ◽  
David Jordan
Keyword(s):  
Discrete Time ◽  
New Method ◽  
Discrete Time System ◽  
Time System ◽  
System Reduction
Sign in / Sign up

Export Citation Format

Share Document