A unified framework for race analysis of asynchronous networks
- 1 January 1989
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 36 (1) , 20-45
- https://doi.org/10.1145/58562.59301
Abstract
A unified framework is developed for the study of asynchronous circuits of both gate and MOS type. A basic network model consisting of a directed graph and a set of vertex excitation functions is introduced. A race analysis model, using three values (0, 1, and x), is developed for studying state transitions in the network. It is shown that the results obtained using this model are equivalent to those using ternary simulation. It is also proved that the set of state variables can be reduced to a minimum size set of feedback variables, and the analysis still yields both the correct state transitions and output hazard information. Finally, it is shown how the general results above are applicable to both gate and MOS circuits.Keywords
This publication has 13 references indexed in Scilit:
- A Characterization of Ternary Simulation of Gate NetworksIEEE Transactions on Computers, 1987
- Boolean Analysis of MOS CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Algorithmic Aspects of Symbolic Switch Network AnalysisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Combinational static CMOS networksIntegration, 1987
- 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
- A Note on Three-Valued Logic SimulationIEEE Transactions on Computers, 1972
- Analysis of Asynchronous Circuits Under Different Delay AssumptionsIEEE Transactions on Computers, 1968
- Hazard Detection in Combinational and Sequential Switching CircuitsIBM Journal of Research and Development, 1965
- Signal Flow Graph Techniques for Sequential Circuit State DiagramsIEEE Transactions on Electronic Computers, 1963