Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (Extended Summary)

Ternary simulation techniques provide efficient methods for the analysis of the behavior of VLSI circuits. However, the results of ternary simulation have not been completely characterized. In this paper we outline the proof of the Brzozowski-Yoeli conjecture (stated in 1976) that the results of the ternary simulation of a gate network N correspond to the results of the binary race analysis of N in the “Multiple-winner” model, where N is the network N in which a delay has been inserted in each wire.