Parallel and sequential computation on Boolean networks

DOI10.1016/0304-3975(85)90171-9zbMath0607.94014OpenAlexW2072107284MaRDI QIDQ1086219

Françoise Fogelman-Soulié

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90171-9

zbMATH Keywords

entropystabilityparallel computationsequential computationsdiscrete iterationsforcing domain

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items

Antichaos in a class of random Boolean cellular automata ⋮ Global behavior of homogeneous random neural systems ⋮ Phenomenlogy of nonlocal cellular automata ⋮ Computing maximal and minimal trap spaces of Boolean networks

Cites Work

• Unnamed Item
• Frustration and stability in random Boolean networks
• Specific roles of the different Boolean mappings in random networks
• Transient length in sequential iteration of threshold functions
• Statistical mechanics of cellular automata
• A Theorem on Boolean Matrices