Controllability of switched boolean networks with constraints by dynamic logic-based switching
摘要
By resorting to the tool of semi-tensor product (STP), this paper investigates controllability of successor-restricted switched boolean control networks (SBCNs) with undesirable states, where the switching signals of the successor-restricted SBCNs are regulated by a logical dynamic system (LDS) obeying some certain constraints. Based on the method of algebraic state space representation, a successor-restricted SBCN can be equivalently transformed into an unconstrained switched logical control system (SLCS). By constructing the novel merged state incidence matrix, we obtain the necessary and sufficient conditions for reachability and controllability avoiding the set of undesirable states. Algorithms for determining a control sequence between any two given states avoiding undesirable states are presented. Finally, two numerical examples are given to demonstrate the effectiveness of the results proposed in this paper.