Abstract
The observability of Boolean control networks is investigated. The pairs of states are classified into three classes: (i) diagonal, (ii) h-distinguishable, and (iii) h-indistinguishable. For h-indistinguishable pairs, we construct a matrix W called the transferable matrix, which indicates the control-transferability among h-indistinguishable pairs. Modifying W yields a Boolean matrix U0, which is used as the initial matrix for an iterative algorithm. After finite iterations a stable U∗ is reached, which is called the observability matrix. It is proved that a Boolean control network is observable, if and only if, the last column of U∗, Colr+1(U∗)=1r. Some numerical examples are presented.
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.
