Observability of Boolean Networks via Set Controllability Approach
Daizhan Cheng, Changxi Li, Fenghua He

TL;DR
This paper introduces a novel approach to verify the observability of Boolean control networks by transforming the problem into a set controllability problem, providing necessary and sufficient conditions.
Contribution
It proposes the set controllability concept and develops a method to convert observability verification into a set controllability problem for BCNs.
Findings
Set controllability is defined with necessary and sufficient conditions.
Observability verification is transformed into a set controllability problem.
The approach simplifies the verification process for BCN observability.
Abstract
The controllability and observability of Boolean control network(BCN) are two fundamental properties. But the verification of latter is much harder than the former. This paper considers the observability of BCN via controllability. First, the set controllability is proposed, and the necessary and sufficient condition is obtained. Then a technique is developed to convert the observability into an equivalent set controllability problem. Using the result for set controllability, the necessary and sufficient condition is also obtained for the observability of BCN.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGene Regulatory Network Analysis · Analytical Chemistry and Chromatography
