Sept. 19, 2002
Workshop on
Boolean Problems
Definition: Boolean Network
Directed
Acyclic Graph
Each
node represents a Boolean function
Edge
from node j
to node k if the function
at k
depends syntactically on the variable yj at the output of
j
Primary
inputs (PI) X and outputs (PO) Z
All
signals are binary
External
specification provides allowed input and output combinations (external dont cares)
j
F
PI
PO
yj