Compositional analysis of Boolean networks using local fixed-point iterations

DOI10.1007/978-3-319-45994-3_10MaRDI QIDQ1708662zbMATH OpenOpenAlexFDO

Authors Laurent Fribourg, Romain Soulat, Adrien Le Coënt

Publication date 26 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-45994-3_10

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Symbolic dynamics (37B10)

Recommendations

• Fixed points of Boolean networks with small number of elementary circuits
• Computational methods for asynchronous basins
• A Formal Framework for Composing Qualitative Models of Biological Systems
• AEON: attractor bifurcation analysis of parametrised Boolean networks
• Finding attractors in asynchronous Boolean dynamics

Cited in

(8)

• On spectral techniques in analysis of Boolean networks
• Design of fixed points in Boolean networks using feedback vertex sets and model reduction
• AEON: attractor bifurcation analysis of parametrised Boolean networks
• Deducing local rules for solving global tasks with random Boolean networks
• Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey
• Stability analysis of large-scale Boolean networks via compositional method
• A framework for (de)composing with Boolean automata networks
• Compositional techniques for Boolean networks and attractor analysis

This page was built for publication: Compositional analysis of Boolean networks using local fixed-point iterations

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