A framework for (de)composing with Boolean automata networks

DOI10.1007/978-3-319-92402-1_7MaRDI QIDQ1647320zbMATH OpenOpenAlexFDO

Authors Kévin Perrot, Pacôme Perrotin, Sylvain Sené

Publication date 26 June 2018

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

zbMATH Keywords

simulationmodulesBoolean automata networkswirings

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• On Boolean automata networks (de)composition
• A Formal Framework for Composing Qualitative Models of Biological Systems
• On the flora of asynchronous locally non-monotonic Boolean automata networks
• scientific article; zbMATH DE number 769371
• Compositional analysis of Boolean networks using local fixed-point iterations

Cited in

(7)

• Optimising attractor computation in Boolean automata networks
• Математическая модель процессов флюоресценции с учетом квантового эффекта нелокального экранирования
• On the flora of asynchronous locally non-monotonic Boolean automata networks
• Compositional generation of home states in free choice nets
• Associating parallel automata network dynamics and strictly one-way cellular automata
• On Boolean automata networks (de)composition
• Compositional techniques for Boolean networks and attractor analysis

This page was built for publication: A framework for (de)composing with Boolean automata networks

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