Synchronizing Boolean networks asynchronously

DOI10.1016/j.jcss.2023.04.001arXiv2203.05298OpenAlexW4366267518MaRDI QIDQ6098155

Adrien Richard, Julio Aracena, Lilian Salinas

Publication date: 12 June 2023

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

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

zbMATH Keywords

Boolean networkinteraction graphsynchronizing automatonasynchronous dynamicspositive and negative cycles

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Memoryless computation: new results, constructions, and extensions
• Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time
• Maximum number of fixed points in regulatory Boolean networks
• Negative circuits and sustained oscillations in asynchronous automata networks
• Itérations sur des ensembles finis et automates cellulaires contractants
• A lower bound on the length of a sequence containing all permutations as subsequences
• Boolean monomial dynamical systems
• Pólya's permanent problem
• Fixed points and maximal independent sets in AND-OR networks
• From kernels in directed graphs to fixed points and negative cycles in Boolean networks
• Permanents, Pfaffian orientations, and even directed circuits
• Complexity of fixed point counting problems in Boolean networks
• Fixing monotone Boolean networks asynchronously
• Fixed points in conjunctive networks and maximal independent sets in graph contractions
• Necessary conditions for multistationarity in discrete dynamical systems
• On the computation of fixed points in Boolean networks
• Dimension reduction of large sparse AND-NOT network models
• On the notion of balance of a signed graph
• Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits
• Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability
• Synchronizing Automata and the Černý Conjecture
• Network information flow
• Computing in permutation groups without memory
• Neural networks and physical systems with emergent collective computational abilities.
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: Synchronizing Boolean networks asynchronously