BooleanNet Home
Updated on Friday, October 10, 2026
When trying to understand the role and functioning of a regulatory network, the first step is to assemble the components of the network and the interactions between them.
Large scale mapping of regulatory networks is fairly recent, but modeling efforts date back to the late 1960s and the pioneering work of Stuart Kauffman and Rene Thomas.
In a Boolean representation the interactions form a directed graph in which each node receives inputs from its neighbors. Each node is in a binary (on/off) state, and whether it will be on or off at the next moment is governed by a Boolean function.
A Boolean function is a statement acting on the inputs using the operators and, or and not; its output is on if the statement is true and off otherwise.
This site is meant to serve as a resource for Boolean network modeling. It collects tutorials, examples, and best practices. It is a work in progress, contributions are welcome.
Contribute via the GitHub repository:
Discussion forum:
Created with Quarto.