A binary decision diagram (BDD) stores a Boolean function as a graph of decisions, one input at a time. The BDD Workbench builds them from expressions, Verilog and standard logic files, with CUDD 3.0.0 compiled to run in your browser. Try your own expression. Expressions are built in your browser and never leave it.
Verification tools need to store a function, combine it with others and ask questions about it without listing every input. A BDD does all three.
Is one function equal to another? Under a fixed variable order, every Boolean function has exactly one reduced BDD. Two functions are equal exactly when their diagrams are the same, so an equivalence check compares two diagrams.
How large is a function? A BDD's size depends on the order of its variables. x1·y1 + x2·y2 + x3·y3 + x4·y4 takes 31 nodes with every x above every y, and 9 with each x beside its y.
Which states can a design reach? A BDD can stand for a set of states. Symbolic model checkers compute the set a design reaches one step at a time, without listing its states one by one.
1. Choose a task. The tabs at the top of the Workbench name the six tasks. Each opens with an example.
2. Load an example or open your file. Examples holds the examples for the current task. Open file, or a file dropped on the page, opens expressions, Verilog, DIMACS CNF or AIGER.
3. Read the diagram and the numbers. A solid edge is the input's value 1, a dashed edge 0. Hover a node for its facts. Download the diagram as SVG, PNG or DOT, or Share a link that reopens exactly what you see.
The table lists each format the Workbench opens, the tasks that open it, where it is built, and its limits. Expressions, CNF and AIGER files never leave your browser. Verilog goes to formal.org's server, where Yosys converts it to AIGER; the design is not stored.
A BDD can grow exponentially with the number of inputs. So that no page hangs and no job runs for minutes, every operation has a budget, and the Workbench says which one stopped it and what to try.
2 s: for each operation on the diagram.
200,000: nodes at most in the engine.
250: nodes at most in a drawing; a larger diagram is shown as nodes per level.
45 s: at most for Yosys to convert a design, and you can cancel it at any time.
Binary Decision Diagrams with CUDD: 8 modules, 32 katas. Reduction, Apply, variable order, CUDD in C, equivalence checking and reachability. Its module pages embed the Workbench, and its katas are answered with it.
It starts with Draw a function and the majority of three inputs.