Synchronism versus asynchronism in monotonic Boolean automata networks

DOI10.1007/S11047-016-9608-8MaRDI QIDQ6062004zbMATH OpenOpenAlexFDO

Authors Mathilde Noual, Sylvain Sené

Publication date 30 November 2023

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-016-9608-8

zbMATH Keywords

Boolean automata networksasynchronous transition graphelementary transition graphsensitivity to synchronismtime in interaction systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Boolean networks synchronism sensitivity and XOR circulant networks convergence time
• About block-parallel Boolean networks: a position paper
• Asynchronous simulation of Boolean networks by monotone Boolean networks
• Boolean networks: beyond generalized asynchronicity
• Block-sequential update schedules and Boolean automata circuits

Cites work

• scientific article; zbMATH DE number 3980080 (Why is no real title available?)
• scientific article; zbMATH DE number 4042465 (Why is no real title available?)
• scientific article; zbMATH DE number 45557 (Why is no real title available?)
• scientific article; zbMATH DE number 2046048 (Why is no real title available?)
• A logical calculus of the ideas immanent in nervous activity
• About non-monotony in Boolean automata networks
• Asynchronous cellular automata and dynamical properties
• Boolean dynamics of networks with scale-free topology
• Boolean networks synchronism sensitivity and XOR circulant networks convergence time
• Comparison between parallel and serial dynamics of Boolean networks
• Comportement périodique des fonctions à seuil binaires et applications
• Computational aspects of asynchronous cellular automata
• Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
• Frustration and overblocking on graphs
• Negative circuits and sustained oscillations in asynchronous automata networks
• On limit cycles of monotone functions with symmetric connection graph
• Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority

Cited in

(13)

• Learning any memory-less discrete semantics for dynamical systems represented by logic programs
• \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
• On simulation in automata networks
• Concurrency in Boolean networks
• Generalising the maximum independent set algorithm via Boolean networks
• Dynamical stability of threshold networks over undirected signed graphs
• Asynchronous dynamics of isomorphic Boolean networks
• About block-parallel Boolean networks: a position paper
• On the influence of the interaction graph on a finite dynamical system
• Computing the probability of getting infected: on the counting complexity of bootstrap percolation
• Linear cuts in Boolean networks
• Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata
• Modeling and Programming Asynchronous Automata Networks: The MOCA Approach

This page was built for publication: Synchronism versus asynchronism in monotonic Boolean automata networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062004)