Accurate ternary-valued compiled logic simulation of complex logic networks by OTDD composition

We describe a technique toward constructing a ternary-valued logic simulator which is free of combinational 'U'-inaccuracies. The method is accurate in the presence of reconvergent fanout, and is described solely in terms of the composition of incompletely-specified functions under Kleenean strong ternary logic. We propose an implementation based on the Ordered Ternary Decision Diagram (OTDD), discuss its limitations, and examine its performance on standard ISCAS 85 benchmarks.<
>