A semantics for Boolean networks consistent with regulatory threshold constraints

DOI10.1016/J.JTBI.2026.112377MaRDI QIDQ6838156zbMATH OpenFDO

Authors Philippe Dague

Publication date 25 March 2026

Published in Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JTBI.2026.112377

zbMATH Keywords

Boolean networksinfluence graphmost permissive semanticsreachabilitysingle threshold networksthreshold consistencyupdate semantics

Mathematics Subject Classification ID

Systems biology, networks (92C42) Networked control (93B70) Boolean control/observation systems (93C29)

Cites work

• A general model of binary opinions updating
• A model of influence based on aggregation functions
• Bringing memory to Boolean networks: a unifying framework
• Computing maximal and minimal trap spaces of Boolean networks
• Concurrency in Boolean networks
• scientific article; zbMATH DE number 50840 (Why is no real title available?)
• Linear cuts in Boolean networks
• On the number of different dynamics in Boolean networks with deterministic update schedules

This page was built for publication: A semantics for Boolean networks consistent with regulatory threshold constraints

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