Abstract
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.
This work was supported by the National Research Council of Canada under Grant A-1617.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
BRZOZOWSKI, J.A.; YOELI, M. Digital Networks. Prentice-Hall, Inc. — in preparation.
MILLER, R.E. Switching Theory, Vol.2, John Wiley and Sons, Inc., New York, 1965.
MULLER, D.E. Lecture Notes on Asynchronous Circuit Theory. Digital Computer Laboratory, University of Illinois, Spring 1961.
TEXAS INSTRUMENTS STAFF. The TTL Data Book for Design Engineers. Texas Instruments Inc., 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brzozowski, J.A., Yoeli, M. (1975). Models for analysis of races in sequential networks. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_664
Download citation
DOI: https://doi.org/10.1007/3-540-07162-8_664
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07162-4
Online ISBN: 978-3-540-37492-3
eBook Packages: Springer Book Archive