1 February 2015 in Automatica
8 May 2017 in IEEE Transactions on Automatic Control
This paper tackles the controllability problem of Boolean control networks (BCNs). By resorting to the semi-tensor product technique and the Warshall algorithm, several improved novel reachability and controllability criteria are obtained for the BCNs. Through constructing a sequence of rigorous Boolean matrices, controllability matrix of the considered BCNs is derived iteratively. It is worth pointing out that the proposed method has lower computational complexity, and thus facilitates the reachability and controllability analysis for BCNs. In addition, the issue concerning controllability of BCNs with undesirable interior states is investigated by checking a set of designated Boolean matrices. Finally, to test the effectiveness of the obtained theoretical results, a genetic network model known as the λ switch is used as an example for numerical simulation.
21 March 2013 in Mathematical Methods in the Applied Sciences
13 February 2020 in IEEE Transactions on Automatic Control
In this article, a general theoretical framework is developed for the state estimation problem of stochastic time-varying Boolean networks (STVBNs). The STVBN consists of a system model describing the evolution of the Boolean states and a model relating the noisy measurements to the Boolean states. Both the process noise and the measurement noise are characterized by sequences of mutually independent Bernoulli distributed stochastic variables taking values of 1 or 0, which imply that the state/measurement variables may be flipped with certain probabilities. First, an algebraic representation of the STVBNs is derived based on the semitensor product. Then, based on Bayes' theorem, a recursive matrix-based algorithm is obtained to calculate the one-step prediction and estimation of the forward-backward state probability distribution vectors. Owing to the Boolean nature of the state variables, the Boolean Bayesian filter is designed that can be utilized to provide the minimum MSE state estimate for the STVBNs. The fixed-interval smoothing filter is also obtained by resorting to the forward-backward technique. Finally, a simulation experiment is carried out for the context estimation problem of the $p53$-$MDM2$ negative-feedback gene regulatory network.
11 April 2019 in IEEE Transactions on Neural Networks and Learning Systems
This paper is concerned with the local synchronization problem for the interconnected Boolean networks (BNs) without and with stochastic disturbances. For the case without stochastic disturbances, first, the limit set and the transient period of the interconnected BNs are discussed by resorting to the properties of the reachable set for the global initial states set. Second, in terms of logical submatrices of a certain Boolean vector, a compact algebraic expression is presented for the limit set of the given initial states set. Based on it, several necessary and sufficient conditions are derived assuring the local synchronization of the interconnected BNs. Subsequently, an efficient algorithm is developed to calculate the largest domain of attraction. As for the interconnected BNs with stochastic disturbances, first, mutually independent two-valued random logical variables are introduced to describe the stochastic disturbances. Then, the corresponding local synchronization criteria are also established, and the algorithm to calculate the largest domain of attraction is designed. Finally, numerical examples are employed to illustrate the effectiveness of the obtained results/algorithms.