Finite-Time Disturbance Decoupling of Boolean Control Networks

In this article, the finite-time disturbance decoupling problem (FTDDP) of Boolean networks (BNs) and Boolean control networks (BCNs) is studied. A novel necessary and sufficient condition is first provided to determine whether a given BN is finite-time disturbance decoupled. Then, an algorithm is devised to find the shortest time that guarantees that a given BN is finite-time disturbance decoupled. In addition, using a constructed truth matrix, a necessary and sufficient condition for solving the disturbance decoupling problem of BCNs is proposed, and all possible time optimal state feedback controllers are designed. Finally, two examples are introduced to illustrate the feasibility of the obtained results.

Automated summary

In this article, the finite-time disturbance decoupling problem of Boolean networks (BNs) and Boolean control networks (BCNs) is studied. A novel necessary and sufficient condition is provided to determine whether a given BN is finite-time disturbance decoupled. An algorithm is devised to find the shortest time that guarantees that a given BN is finite-time disturbance decoupled. In addition, a necessary and sufficient condition for solving the disturbance decoupling problem of BCNs is proposed, and all possible time optimal state feedback controllers are designed.