Abstract
Using a graph-theoretic approach, we derive a new sufficient condition for observability of a Boolean control network (BCN). Based on this condition, we describe two algorithms: the first selects a set of nodes so that observing this set makes the BCN observable. The second algorithm builds an observer for the observable BCN. Both algorithms are sub-optimal, as they are based on a sufficient but not necessary condition for observability. Yet their time-complexity is linear in the length of the description of the BCN, rendering them feasible for large-scale networks. We discuss how these results can be used to provide a sub-optimal yet polynomial-complexity algorithm for the minimal observability problem in BCNs. Some of the theoretical results are demonstrated using a BCN model of the core network regulating the mammalian cell cycle.
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.