Stability structures of conjunctive Boolean networks

DOI10.1016/j.automatica.2017.11.017zbMath1387.93092arXiv1603.04415OpenAlexW2963805168MaRDI QIDQ1640224

Xudong Chen, Zuguang Gao, Tamer Başar

Publication date: 14 June 2018

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.04415

zbMATH Keywords

stability analysisdiscrete time dynamicssystems biologynetworked control systems

Mathematics Subject Classification ID

Related Items (9)

On the dynamics of semilattice networks ⋮ Minimal controllability of conjunctive Boolean networks is NP-complete ⋮ Controllability and stabilization of periodic switched Boolean control networks with application to asynchronous updating ⋮ Fault detection and pinning control of Boolean networks ⋮ Identification and stabilization of faulty Boolean control networks ⋮ Turning block-sequential automata networks into smaller parallel networks with isomorphic limit dynamics ⋮ Logical matrix factorization towards topological structure and stability of probabilistic Boolean networks ⋮ Stability analysis of probabilistic Boolean networks with switching topology ⋮ Reduction and Analysis of Boolean Control Networks by Bisimulation

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of equilibrium in competitive diffusion games on social networks
• About non-monotony in Boolean automata networks
• Disjunctive networks and update schedules
• A finite-difference sieve to count paths and cycles by length
• Finding and counting given length cycles
• The dynamics of conjunctive and disjunctive Boolean network models
• Symmetry types of periodic sequences
• Algorithms to count paths and cycles
• On the flora of asynchronous locally non-monotonic Boolean automata networks
• Boolean monomial dynamical systems
• Nested canalyzing, unate cascade, and polynomial functions
• A general purpose algorithm for counting simple cycles and simple paths of any length
• Optimal control of LTI systems over unreliable communication links
• On the computation of fixed points in Boolean networks
• Dimension reduction of large sparse AND-NOT network models
• Aperiodic rings, necklace rings, and Witt vectors
• AND-NOT logic framework for steady state analysis of Boolean network models
• On the Convergence of Boolean Automata Networks without Negative Cycles
• Finding cycles and trees in sublinear time
• On Algorithms for Enumerating All Circuits of a Graph
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• Finding All the Elementary Circuits of a Directed Graph
• A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph

This page was built for publication: Stability structures of conjunctive Boolean networks