Computing preimages of Boolean networks
Related Experiment Video
Updated: May 5, 2026

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
Published on: March 2, 2015
Abstract:
In this paper we present an algorithm based on the sum-product algorithm that finds elements in the preimage of a feed-forward Boolean networks given an output of the network. Our probabilistic method runs in linear time with respect to the number of nodes in the network. We evaluate our algorithm for randomly constructed Boolean networks and a regulatory network of Escherichia coli and found that it gives a valid solution in most cases.
Related Concept Videos
Network Function of a Circuit
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Theorems of Pappus and Guldinus: Problem Solving
Net Change Theorem
Norton's Theorem
Castigliano's Theorem: Problem Solving