LAUSR

Abstract This paper investigates the set stability of probabilistic Boolean networks (PBNs) with switching topology. To deal with this problem, two novel concepts, set reachability and the largest invariant set family, are defined. By constructing an auxiliary system, the necessary and sufficient conditions for verifying set reachability are given and the calculation method for the largest invariant set family is obtained. Based on these two results, an equivalent condition of set stability is derived, which can be used to determine whether a PBN with switching topology can be stabilized to a given set. In addition, the design method of switching signal is proposed by combining the characteristic of the largest invariant set family, and a numerical example is reported to demonstrate the efficiency of presented approach.