Abstract: A new analytical framework consisting of two phenomena: single sample and multiple samples, is proposed to deal with the identification problem of Boolean control networks (BCNs) systematically and comprehensively. Under this framework, the existing works on identification can be categorized as special cases of these two phenomena. Several effective criteria for determining the identifiability and the corresponding identification algorithms are proposed. Three important results are derived: (1) If a BN is observable, it is uniquely identifiable; (2) If a BCN is O1-observable, it is uniquely identifiable, where O1-observability is the most general form of the existing observability terms; (3) A BN or BCN may be identifiable, but not observable. In addition, remarks present some challenging future research and contain a preliminary attempt about how to identify unobservable systems.
Recommendations
Cites work
- A Linear Representation of Dynamics of Boolean Networks
- An efficient top-down search algorithm for learning Boolean networks of gene expression
- Boolean dynamics of networks with scale-free topology
- Control of Boolean networks: hardness results and algorithms for tree structured networks
- Controllability and observability of Boolean control networks
- Input-state incidence matrix of Boolean control networks and its applications
- Optimal infinite-horizon control for probabilistic Boolean networks
- Realization of Boolean control networks
- The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}
Cited in
(56)- Simultaneous stabilization for a set of Boolean control networks
- Set stability and set stabilization of Boolean control networks based on invariant subsets
- Robust feedback set stabilization of logic networks with state-dependent uncertain switching and control constraints
- Observability conditions of Boolean control networks
- Fundamental structures of invariant dual subspaces with respect to a Boolean network
- System decomposition with respect to inputs for Boolean control networks
- Observability of Boolean control networks with time-variant delays in states
- Control Flow Analysis of Generalised Boolean Networks
- Controllability analysis and control design for switched Boolean networks with state and input constraints
- Finite-time observability of probabilistic Boolean control networks
- Output-feedback stabilization of probabilistic Boolean control networks
- Consistent stabilizability of switched Boolean networks
- Asymptotical feedback controllability of probabilistic logic control networks
- Morgan's problem of Boolean control networks
- On regular subspaces of Boolean control networks
- \(l_{1}\)-gain analysis and model reduction problem for Boolean control networks
- Finite-time observability of probabilistic logical control systems
- Set reachability and observability of probabilistic Boolean networks
- Redefined observability matrix for Boolean networks and distinguishable partitions of state space
- Minimal finite-time observability of Markovian jump Boolean networks
- Existence and number of fixed points of Boolean transformations via the semi-tensor product method
- Controllability and observability of singular Boolean control networks
- A weighted pair graph representation for reconstructibility of Boolean control networks
- New results on model reconstruction of Boolean networks with application to gene regulatory networks
- On reachability and controllability of switched Boolean control networks
- Controllability and reachability of periodically time-variant mixed-valued logical control networks
- Output tracking control of Boolean control networks via state feedback: constant reference signal case
- Detectability of Boolean networks: a finite-time convergent matrix approach
- On Boolean control networks with maximal topological entropy
- Finite automata approach to observability of switched Boolean control networks
- A survey on observability of Boolean control networks
- Data identification for improving gene network inference using computational algebra
- Further results on observability verification of Boolean control networks
- On identification of Boolean control networks
- Stabilizability analysis and switching signals design of switched Boolean networks
- Invertibility and nonsingularity of Boolean control networks
- Identification of a class of singular Boolean control networks
- Necessary and sufficient vertex partition conditions for input-output decoupling of Boolean control networks
- Controllability decomposition of dynamic-algebraic Boolean control networks
- Finite-time controllability and stabilization of probabilistic logical systems with state-dependent constraint via subset transition method
- Observability of Boolean networks: a graph-theoretic approach
- State feedback based output tracking control of probabilistic Boolean networks
- Input-output decoupling control design for switched Boolean control networks
- Data informativity for analysis and control design of Boolean control networks
- Controllability and observability of state-dependent switched Boolean control networks with input constraints
- Observability of Boolean control networks with stochastic disturbances
- Stabilisation of Boolean control networks with state-dependent constraints via space extension and pre-feedback
- Topological structure of implicit Boolean networks
- Alternative approach to calculate the structure matrix of Boolean network with semi-tensor product
- Regular subspaces and invariant subspaces of Boolean control networks
- Graph theory methods for decomposition w.r.t. outputs of Boolean control networks
- Parameter learning of stochastic Boolean networks
- Lyapunov-based stability and construction of Lyapunov functions for Boolean networks
- Advancing control of Boolean control networks with delays in output and states: from the Smith predictor to its modification
- On the observability of free Boolean networks via the semi-tensor product method
- On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors
This page was built for publication: Identification of Boolean control networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534280)
