Abstract
We show some new results on the observability of Boolean control networks (BCNs). First, to study the observability, we combine two BCNs with the same transition matrix into a new BCN. Then, we propose the concept of a reachable set that results in a given set of initial states, and we derive four additional necessary and sufficient conditions for the observability of BCNs. In addition, we present an algoriTheoRemark and construct an observability graph to determine the observability of BCNs. Finally, we illustrate the obtained results using three numerical examples.
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.
