Models for analysis of races in sequential networks
Two models for the analysis of races in asynchronous sequential networks constructed with gates are described. The first model is a modification and a formalization of intuitively clear concepts. The second model is applicable, if the delays associated with the gates do not differ too widely from each other. A new concept of internal state is required in this model; namely, in addition to the values of gate outputs, one must also know the previous history of the race, in order to predict the next state.
Unable to display preview. Download preview PDF.
- [B & Y]BRZOZOWSKI, J.A.; YOELI, M. Digital Networks. Prentice-Hall, Inc. — in preparation.Google Scholar
- [MI]MILLER, R.E. Switching Theory, Vol.2, John Wiley and Sons, Inc., New York, 1965.Google Scholar
- [MU]MULLER, D.E. Lecture Notes on Asynchronous Circuit Theory. Digital Computer Laboratory, University of Illinois, Spring 1961.Google Scholar
- [TI]TEXAS INSTRUMENTS STAFF. The TTL Data Book for Design Engineers. Texas Instruments Inc., 1973.Google Scholar