Abstract
Hazards can be globally eliminated from an asynchronous circuit synthesized from a Signal Transition Graph by repeatedly solving an appropriate Linear Program. This article describes how to analyze the STG specification and the synthesized circuit, using bounded delay information, to formulate the problem and use a branch-and-bound procedure to solve it. Known information about the environment delays can be expressed as time bounds on the external signal transitions, and it can be exploited by the proposed methodology.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V.I. Varshavsky, et al.,Self-timed Control of Concurrent Processes, Boston, MA: Kluwer Academic Publishers, 1990. (Russian edition: 1986).
T.A. Chu, “Synthesis of self-timed VLSI circuits from graphtheoretic specifications,” Ph.D. thesis, MIT, June 1987.
S. Burns and A. Martin, “A synthesis method for self-timed VLSI circuits,”Proceedings of the International Conference on Computer Design, 1987.
T. Meng, “Asynchronous design for digital signal processing architectures,” Ph.D. thesis, U.C. Berkeley, November 1988.
L. Lavagno, K. Keutzer, and A. Sangiovanni-Vincentelli, “Algorithms for synthesis of hazard-free asynchronous circuits,”Proceedings of the Design Automation Conference, June 1991.
S.M. Nowick and D.L. Dill, “Automatic synthesis of locallyclocked asynchronous state machines,”Proceedings of the International Conference on Computer-Aided Design, November 1991.
L.Y. Rosenblum and A.V. Yakovlev, “Signal graphs: from selftimed to timed ones,”International Workshop on Timed Petri Nets, Torino, Italy, 1985.
T.-A. Chu, “Synthesis of self-timed control circuits from graphs: an example,”Proceedings of the International Conference on Computer Design, 1986, pp. 565–571.
S.H. Unger,Asynchronous Sequential Switching Circuits, Wiley Interscience, 1969.
P.A. Beerel and T. H.-Y. Meng. “Gate-level synthesis of speedindependent asynchronous control circuits,”ACM Intl. Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, March 1992.
T.-A. Chu, “On the models for designing VLSI asynchronous digital systems,”Integration: the VLSI journal, vol. 4, 1986, pp. 99–113.
C.A. Petri, “Kommunikation mit automaten,” Ph.D. thesis, Bonn, Institut für Instrumentelle Mathematik, 1962.
J.L. Peterson,Petri Nets, volume 9. ACM Computing Surveys, No. 3, September 1977.
T. Murata, “Petri Nets: Properties, analysis and applications,”Proceedings of the IEEE, April 1989, pp. 541–580.
M. Hack, “Analysis of production schemata by petri nets,” Technical Report TR 94, Project MAC, MIT, 1972.
C.W. Moon, P.R. Stephan, and R.K. Brayton, “Synthesis of hazard-free asynchronous circuits from graphical specifications,”Proceedings of the International Conference on Computer-Aided Design, November 1991.
P. Vanbekbergen, “Optimized synthesis of asynchronous control circuits from graph-theoretic specifications,”Proceedings of the International Conference on Computer-Aided Design, November 1990, pp. 184–187.
L. Lavagno, K. Keutzer, and A. Sangiovanni-Vincentelli, “Synthesis of verifiably hazard-free asynchronous control circuits,” Technical Report UCB/ERL M90/99, U.C. Berkeley, 1990.
E.B. Eichelberger, “Hazard detection in combinational and sequential switching circuits,”IBM Journal of Research and Development, vol. 9, March 1965.
R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A. Sangiovanni-Vincentelli,Logic Minimization Algorithms for VLSI Synthesis. Boston, MA: Kluwer Academic Publishers, 1984.
S.M. Nowick and D.L. Dill, “Exact two-level minimization of hazard-free logic with multiple-input changes,”Proceedings of the International Conference on Computer-Aided Design, November 1992.
J.A. Brzozowski and C.-J. Seger, “Advances in asynchronous circuit theory—part ii: Bounded inertial delay models, mos circuits, design techniques,”Bulletin of the European Association of Theoretical Computer Science, March 1991.
M.R. Garey and D.S. Johnson,Comuters and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Company, 1979.
P. Vanbekbergen, G. Goossens, and H. DeMan, “Specification and analysis of timing constraints in signal transition graphs,Proceedings of the European Design Automation Conference, 1992, pp. 302–306.
K. McMillan and D. Dill, “Algorithms for interface timing verification,”ACM Intl. Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, March 1992.
D. Wong, G. DeMicheli, and M. Flynn, “Inserting active delay elements to achieve wave pipelining,”Proceedings of the International Conference on Computer-Aided Design, November 1989, pp. 270–273.
S.M. Burns, “Performance analysis and optimization of asynchronous circuits,” Ph.D. thesis, California Institute of Technology, December 1990.
C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, 1982, Englewood Cliffs, N.J.: Prentice-Hall.
Ellen M. Sentovich, Kanwar Jit Singh, Luciano Lavagno, Cho Moon, Rajeev Murgai, Alexander Saldanha, Hamid Savoj, Paul R. Stephan, Robert K. Brayton, and Alberto SangiovanniVincentelli, “SIS: A system for sequential circuit synthesis,” Technical Report UCB/ERL M92/41, U.C. Berkeley, May 1992.
E.M. Sentovich, K.J. Singh, C. Moon, H. Savoj, R.K. Brayton, and A.L. Sangiovanni-Vincentelli, “Sequential circuit design using synthesis and optimization,”Proceedings of the International Conference on Computer Design, October 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lavagno, L., Shenoy, N. & Sangiovanni-Vincentelli, A. Linear programming for hazard elimination in asynchronous circuits. Journal of VLSI Signal Processing 7, 137–160 (1994). https://doi.org/10.1007/BF02108194
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02108194