Observability of Boolean networks: a graph-theoretic approach

DOI10.1016/j.automatica.2013.04.038zbMath1364.93095OpenAlexW2012641411MaRDI QIDQ2628669

Michael Margaliot, Dmitriy Laschov, Guy Even

Publication date: 2 June 2017

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2013.04.038

zbMATH Keywords

computational complexityobservabilitysystems biologygene regulating networkslogical systemsBoolean control networksobservable graphs

Mathematics Subject Classification ID

Observability (93B07) Applications of graph theory to circuits and networks (94C15) Complexity and performance of numerical algorithms (65Y20) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (57)

Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers ⋮ Observability and reconstructibility of bounded cellular automata ⋮ Symbolic dynamics of Boolean control networks ⋮ Redefined observability matrix for Boolean networks and distinguishable partitions of state space ⋮ Observability of lattice graphs ⋮ Observability of Boolean networks via set controllability approach ⋮ Graph theory methods for decomposition w.r.t. outputs of Boolean control networks ⋮ Sampled-data controllability and stabilizability of Boolean control networks: nonuniform sampling ⋮ Stabilization of dynamic-algebraic Boolean control networks via state feedback control ⋮ On Identification of Boolean Control Networks ⋮ Morgan’s problem of Boolean control networks ⋮ On quotients of Boolean control networks ⋮ On detectability of Boolean control networks ⋮ Variable structure controller design for Boolean networks ⋮ Minimal observability of Boolean control networks ⋮ Function perturbations on singular Boolean networks ⋮ Global robust stability and stabilization of Boolean network with disturbances ⋮ Discrimination of singleton and periodic attractors in Boolean networks ⋮ Asymptotical feedback controllability of continuous-time probabilistic logic control networks ⋮ A survey on observability of Boolean control networks ⋮ Bisimulations of Probabilistic Boolean Networks ⋮ A unified transform method for general robust property of probabilistic Boolean control networks ⋮ Design of reduced-order and pinning controllers for probabilistic Boolean networks using reinforcement learning ⋮ Robust invariant set analysis of Boolean networks ⋮ A note on observability of Boolean control networks ⋮ Controllability of generalized asynchronous Boolean networks with periodical impulsive control ⋮ Invertibility and nonsingularity of Boolean control networks ⋮ Finite automata approach to observability of switched Boolean control networks ⋮ Further results on observability verification of Boolean control networks ⋮ Bisimulations of Boolean Control Networks ⋮ On Regular Subspaces of Boolean Control Networks ⋮ Dynamics of semilattice networks with strongly connected dependency graph ⋮ Subspace controllability of Boolean networks ⋮ On disturbance decoupling problem of Boolean control networks ⋮ An average optimal control approach to the set stabilization problem for boolean control networks ⋮ Dynamics and control of singular boolean networks ⋮ Topologies on quotient space of matrices via semi‐tensor product ⋮ System decomposition with respect to inputs for Boolean control networks ⋮ On Boolean control networks with maximal topological entropy ⋮ Stabilizability analysis and switching signals design of switched Boolean networks ⋮ Kalman decomposition for Boolean control networks ⋮ Asymptotical feedback controllability of probabilistic logic control networks ⋮ Distributional observability of probabilistic Boolean networks ⋮ Expansive automata networks ⋮ An adjoint network approach to design stabilizable switching signals of switched Boolean networks ⋮ Set reachability and observability of probabilistic Boolean networks ⋮ Observability of Boolean networks via matrix equations ⋮ Lyapunov‐Based Stability of Mix‐Valued Logical Networks ⋮ Complex systems with impulsive effects and logical dynamics: a brief overview ⋮ Controllability and observability of Boolean networks arising from biology ⋮ Generalized cluster synchronization of Boolean control networks with delays in both the states and the inputs ⋮ Observability of singular Boolean control networks with state delays ⋮ A Weighted Pair Graph Representation for Reconstructibility of Boolean Control Networks ⋮ Necessary and sufficient vertex partition conditions for input-output decoupling of Boolean control networks ⋮ Reduction and Analysis of Boolean Control Networks by Bisimulation ⋮ Reduced-order observer design for fault diagnosis of Boolean control networks ⋮ Observability for Markovian jump Boolean network with random delay effect in states

Cites Work

• Unnamed Item
• Unnamed Item
• Controllability of Boolean control networks via the Perron-Frobenius theory
• Identification of Boolean control networks
• Boolean models of bistable biological systems
• Observable graphs
• Input-state incidence matrix of Boolean control networks and its applications
• Controllability and observability of Boolean control networks
• Realization of Boolean control networks
• Analysis and control of Boolean networks. A semi-tensor product approach.
• Bilinear control systems. Matrices in action
• On the structural identifiability of biological compartmental systems in a general input-output configuration
• Observation of bilinear systems with application to biological control
• Boolean dynamics of networks with scale-free topology
• Attractor analysis of asynchronous Boolean models of signal transduction networks
• The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}
• Robustness and fragility of Boolean models for genetic regulatory networks
• Boolean network analysis of a neurotransmitter signaling pathway
• Control of Boolean networks: hardness results and algorithms for tree structured networks
• Superpolynomial Growth in the Number of Attractors in Kauffman Networks
• Minimum-Time Control of Boolean Networks
• A Linear Representation of Dynamics of Boolean Networks
• Disturbance Decoupling of Boolean Control Networks
• A Maximum Principle for Single-Input Boolean Control Networks
• Observability, Reconstructibility and State Observers of Boolean Control Networks
• A survey of computational complexity results in systems and control

This page was built for publication: Observability of Boolean networks: a graph-theoretic approach