Abstract
This paper studies the reachability of 2-order logical control networks (LCNs). First, using semi-tensor product (STP) method of matrices, the matrix expression form of a 2-order LCN is given. Second, a 2-order LCN is converted into another form whose reachability is easy to get by a class of recurrence matrices. Then, the reachability of a 2-order LCN is obtained. Finally, an algorithm is given to find the control sequences realizing the reachability of 2-order LCNs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
