Abstract
In this paper, using semi-tensor product and the vector form of Boolean logical variables, the Boolean control network (BCN) is expressed as a bilinear discrete time system about state and control variables. Based on the algebraic form, the reachability and controllability of BCNs are discussed. Also, the necessary and sufficient conditions for reachability and controllability are given. At last, the control sequence that steers one state to another is constructed. The reachability and controllability discussed here are under certain constraint, where the trajectory of states are avoiding some undesirable states set. The definitions discussed in this paper have practical meaning.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.