Set Stability of Switched Boolean Networks with Function Perturbation

This article investigates the set stability of switched Boolean networks (SBNs) with function perturbation under arbitrary switching signal. Firstly, the system is converted into algebraic form utilizing semi-tensor product (STP) of matrices. Secondly, based on algebraic expression, four cases are considered. And then, two theorems are obtained, which can be used to determine whether an SBN is set stability after function perturbation. In addition, according to the theorems, two corresponding corollaries are derived. Finally, an example is given to verify the correctness of the conclusion.