In this paper we investigate the reachability and controllability of delayed switched Boolean control networks (DSBCNs). By resorting to the algebraic state space representation method built using semi-tensor product (STP) of matrices, we provide several necessary and sufficient conditions for these properties to hold which are based on input-state incidence matrix carrying entire network dynamics information. Also, to realize the reachability of DSBCNs in shortest time, an algorithm is presented which finds switching and control sequences forcing initial state trajectory to destination state. At last, an example is given to illustrate the main results.
Reachability and Controllability of Delayed Switched Boolean Control Networks
YERUDKAR, Amol Kerba;Del Vecchio, Carmen;RANA, Navdeep Singh;Glielmo, Luigi
2018-01-01
Abstract
In this paper we investigate the reachability and controllability of delayed switched Boolean control networks (DSBCNs). By resorting to the algebraic state space representation method built using semi-tensor product (STP) of matrices, we provide several necessary and sufficient conditions for these properties to hold which are based on input-state incidence matrix carrying entire network dynamics information. Also, to realize the reachability of DSBCNs in shortest time, an algorithm is presented which finds switching and control sequences forcing initial state trajectory to destination state. At last, an example is given to illustrate the main results.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
