DocumentCode
815293
Title
On the delay-sensitivity of gate networks
Author
Brzozowski, Janusz A. ; Ebergen, Jo C.
Author_Institution
Dept. of Comput. Sci., Waterloo Univ., Ont., Canada
Volume
41
Issue
11
fYear
1992
fDate
11/1/1992 12:00:00 AM
Firstpage
1349
Lastpage
1360
Abstract
In classical switching theory, asynchronous sequential circuits are operated in the fundamental mode. In this mode, a circuit is started in a stable state, and then the inputs are changed to cause a transition to another stable state. The inputs are not allowed to change again until the entire circuit has stabilized. In contrast to this, delay-insensitive circuits-the correctness of which is insensitive to delays in their components and wires-use the input-output mode. In this case, it is assumed that inputs may change again, in response to an output change, even before the entire circuit has stabilized. It is shown that such commonly used behaviors as those of the set-reset latch and Muller´s C-ELEMENT do not have delay-insensitive realizations, if gates are used as the basic components. It is proved that no nontrivial sequential behavior with one binary input possesses a delay-insensitive realization using gates only. The proof makes use of the equivalence between ternary simulation and the general-multiple-winner model of circuit behavior
Keywords
asynchronous sequential logic; delays; ternary logic; Muller´s C-ELEMENT; asynchronous sequential circuits; circuit behavior; delay-sensitivity; gate networks; general-multiple-winner model; set-reset latch; switching theory; ternary simulation; Asynchronous circuits; Boolean functions; Circuit analysis; Circuit simulation; Computer science; Councils; Delay; Latches; Mathematics; Switching circuits;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.177306
Filename
177306
Link To Document