The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
From OpenAlex, which stores abstracts as an
index of words and their positions: what is shown is rebuilt from that,
and reads fluently whether or not it is what the author wrote.
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.>
How it got here
How it got here
agent via openalex
Added
2026-10-27 07:50 UTC
Not denied by
a person 2026-10-29 17:12 UTC
Cite it as
@article{brzozowski1992delaysensitivity,
title = {On the delay-sensitivity of gate networks},
author = {Janusz Brzozowski and Jo Ebergen},
year = {1992},
journal = {IEEE Transactions on Computers},
publisher = {Institute of Electrical and Electronics Engineers},
volume = {41},
number = {11},
pages = {1349--1360},
doi = {10.1109/12.177306},
}