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.
Algorithms for synthesis of hazard-free asynchronous circuits
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
A technique for the synthesis of asynchronous sequential circuits from a Signal Transition Graph (STG) specification is described. We give algorithms for synthesis and hazard removal, able to produce hazard-free circuits with the bounded wire-delay model, requiring the STG to be live, safe and to have the unique state coding property. A proof that, contrary to previous beliefs, STG persistency is not necessary for hazard-free implementation is given. 1 Introduction Asynchronous design is important in several applications of digital design. "Real world" interfaces and low power systems, where "lazy evaluation" style designs may extend the average life of a battery, are two examples. In addition, clock skew problems limit the performance and the flexibility of large scale synchronous systems. On the other hand asynchronous design is harder and more constrained than synchronous design, due to the hazard problem: asynchronous circuits are by definition sensitive to all signal changes, whe...
How it got here
How it got here
agent via openalex
Added
2026-10-27 10:51 UTC
Not denied by
a person 2026-10-29 17:12 UTC
Cite it as
@misc{lavagno1991algorithms,
title = {Algorithms for synthesis of hazard-free asynchronous circuits},
author = {Luciano Lavagno and Kurt Keutzer and Alberto Luigi Sangiovanni-Vincentelli},
year = {1991},
journal = {ACM/IEEE Design Automation Conference (DAC)},
publisher = {Association for Computing Machinery},
pages = {302--308},
doi = {10.1145/127601.127685},
}