A Characterization of Ternary Simulation of Gate Networks
- 1 November 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (11) , 1318-1327
- https://doi.org/10.1109/tc.1987.5009471
Abstract
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 prove a somewhat modified version 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 Ñ in the ``multiple-winner'' model, where Ñ is the network N in which a delay has been inserted in each wire.Keywords
This publication has 6 references indexed in Scilit:
- An analysis of ternary simulation as a tool for race detection in digital MOS circuitsIntegration, 1986
- Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race DetectionIEEE Transactions on Computers, 1986
- Correspondence between ternary simulation and binary race analysis in gate networksPublished by Springer Nature ,1986
- A Switch-Level Model and Simulator for MOS Digital SystemsIEEE Transactions on Computers, 1984
- On a Ternary Model of Gate NetworksIEEE Transactions on Computers, 1979
- Hazard Detection in Combinational and Sequential Switching CircuitsIBM Journal of Research and Development, 1965