Cooperative Boolean systems with generically long attractors I

DOI10.1080/10236198.2012.691167zbMath1266.93006arXiv1302.3008OpenAlexW2730759749MaRDI QIDQ5301058

Winfried Just, Maciej Malicki

Publication date: 2 July 2013

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

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

zbMATH Keywords

chaotic dynamicscooperative systemsBoolean networkslong attractors

Mathematics Subject Classification ID

Decentralized systems (93A14) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items

Complexity of fixed point counting problems in Boolean networks ⋮ Ordered dynamics in biased and cooperative Boolean networks ⋮ Cooperative Boolean systems with generically long attractors. II

Cites Work

• Unnamed Item
• Nontrivial lower bounds for the least common multiple of some finite sequences of integers
• Sorting in \(c \log n\) parallel steps
• Cooperative Boolean systems with generically long attractors. II
• On limit cycles of monotone functions with symmetric connection graph
• Prevalent behavior of strongly order preserving semiflows
• Stability and convergence in strongly monotone dynamical systems.
• Analogues of the Smale and Hirsch theorems for cooperative Boolean and other discrete systems
• Lattice Theoretic Properties of Frontal Switching Functions