Reachability of higher-order logical control networks via matrix method

This paper investigates the reachability of higher-order logical control networks. First, with semi-tensor product method, the matrix expression of a higher-order logical control network is given. Then, a partitioned matrix is constructed, which intuitively shows the input-state mapping information. With this matrix, some conditions are obtained for the reachability of higher-order logical control networks. Finally, an algorithm is designed to find control sequences that drive a given initial state to a given destination state.