Observability Criteria for Boolean Networks
Yongyuan Yu, Min Meng, Jun‐e Feng, Ge Chen
Abstract
This article investigates observability of Boolean control networks (BCNs) and probabilistic Boolean networks (PBNs). First, weak observability of BCNs is discussed via the nonaugmented approach. The obtained result is then applied to determine (asymptotic) observability of PBNs. Finally, complexity of algorithms based on new criteria is analyzed. Compared with existing ones, time and space complexity do not get worse, even are improved under some mild conditions.
Topics & Concepts
ObservabilityProbabilistic logicComputer scienceBoolean functionBoolean modelAnd-inverter graphTheoretical computer scienceMathematicsBoolean circuitAlgorithmDiscrete mathematicsArtificial intelligenceApplied mathematicsGene Regulatory Network AnalysisReceptor Mechanisms and SignalingMicrobial Metabolic Engineering and Bioproduction