Normalization and Solvability of Dynamic-Algebraic Boolean Networks
Abstract:
In this brief, we first study the normalization of dynamic-algebraic Boolean networks (DABNs). A new expression for the normalized DABNs is obtained. As applications of this result, the solvability and uniqueness of the solution to DABNs are then investigated. Necessary and sufficient conditions for the solvability and the uniqueness are obtained. In addition, pinning control to ensure the solvability and uniqueness of the solution to DABNs is also studied. Numerical examples are given to illustrate the efficiency of the proposed results.
More Related Videos
Related Concept Videos
Relation between Mathematical Equations and Block Diagrams
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Fundamental Theorem of Algebra
Constraints and Statical Determinacy
Algebraic Expressions
Stability of Equilibrium Configuration: Problem Solving
Problem-solving in the context of the stability of equilibrium configuration...


