Weak Stabilization of Boolean Networks Under State-Flipped Control

In this brief, stabilization of Boolean networks (BNs) by flipping a subset of nodes is considered, here we call such action state-flipped control. The state-flipped control implies that the logical variables of certain nodes are flipped from 1 to 0 or 0 to 1 as time flows. Under state-flipped control on certain nodes, a state-flipped-transition matrix is defined to describe the impact on the state transition space. Weak stabilization is first defined and then some criteria are presented to judge the same. An algorithm is proposed to find a stabilizing kernel such that BNs can achieve weak stabilization to the desired state with in-degree more than 0. By defining a reachable set, another approach is proposed to verify weak stabilization, and an algorithm is given to obtain a flip sequence steering an initial state to a given target state. Subsequently, the issue of finding flip sequences to steer BNs from weak stabilization to global stabilization is addressed. In addition, a model-free reinforcement algorithm, namely the Q -learning ( Formula: see text) algorithm, is developed to find flip sequences to achieve global stabilization. Finally, several numerical examples are given to illustrate the obtained theoretical results.