Skip to main content
Log in

Hazard Algebras

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

We introduce algebras capable of representing, detecting, identifying, and counting static and dynamic hazard pulses that can occur in the worst case on any wire in a gate circuit. These algebras also permit us to count the worst-case number of signal changes on any wire. This is of interest to logic designers for two reasons: each signal change consumes energy, and unnecessary multiple signal changes slow down the circuit operation. We describe efficient circuit simulation algorithms based on our algebras and illustrate them by several examples. Our method generalizes Eichelberger's ternary simulation and several other algebras designed for hazard detection.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M.A. Breuer and L. Harrison, “Procedures for eliminating static and dynamic hazards in test generation,” IEEE Trans. on Computers, Vol. C-23, pp. 1069–1078, 1974.

    Google Scholar 

  2. J.A. Brzozowski, “A survey of regular expressions and their applications,” IRE Trans. on Electronic Computers, Vol. EC-11, No. 3, pp. 324–335, 1962.

    Google Scholar 

  3. J.A. Brzozowski, “Some applications of ternary algebras,” Publicationes Mathematicae (Debrecen), Vol. 54 (Suppl.), pp. 583–599, 1999.

    Google Scholar 

  4. J.A. Brzozowski, “De Morgan bisemilattices,” in Proc. 30th Int. Symp. on Multiple-Valued Logic, Portland, OR, IEEE Computer Society Press, Los Alamitos, CA, May 2000, pp. 173–178.

    Google Scholar 

  5. J.A. Brzozowski and Z. Ésik, “Hazard algebras (Extended Abstract),” in A Half-Century of Automata Theory, A. Salomaa, D. Wood, and S. Yu (Eds.), World Scientific, Singapore, 2001, pp. 1–19. To put a crossline over L

    Google Scholar 

  6. J.A. Brzozowski, Z. Ésik, and Y. Iland, “Algebras for hazard detection,” in Proc. 31st Int. Symp. on Multiple-Valued Logic, Warsaw, Poland, IEEE Computer Society Press, Los Alamitos, CA, May 2000, pp. 3–12. Also reprinted in M. Fitting and E. Orłowska (Eds.), Beyond Two: Theory and Applications of Multiple-Valued Logic, Physica-Verlag, 2003, pp. 3–24.

    Google Scholar 

  7. J.A. Brzozowski and M. Gheorghiu, “Simulation of gate circuits in the algebra of transients,” in 7th Int. Conf. on Implementation and Application of Automata, Tours, France, July 2002. Lecture Notes in Computer Science, vol. 2608, Springer 2003, pp. 57–66.

    Google Scholar 

  8. J.A. Brzozowski and C.-J.H. Seger, Asynchronous Circuits, Springer-Verlag, 1995.

  9. S. Burris and H.P. Sankappanavar, A Course in Universal Algebra, Springer-Verlag, 1981.

  10. S. Chakraborty and D.L. Dill, “More accurate polynomial-time min-max simulation,” in Proc. 3rd Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, Eindhoven, The Netherlands, IEEE Computer Society Press, Los Alamitos, CA, April 1997, pp. 112–123.

    Google Scholar 

  11. B.A. Davey and H.A. Priestley, Introduction to Lattices and Order, Cambridge University Press, 1990.

  12. E.B. Eichelberger, “Hazard detection in combinational and sequential switching circuits,” IBM J. Research and Development, Vol. 9, pp. 90–99, 1965.

    Google Scholar 

  13. G. Fantauzzi, “An algebraic model for the analysis of logic circuits,” IEEE Trans. on Computers, Vol. C-23, pp. 576–581, 1974.

    Google Scholar 

  14. M. Gheorghiu, “Circuit simulation using a hazard algebra,” MMath Thesis, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1, Dec. 2001. http://maveric.uwaterloo.ca/publication.html.

  15. M. Gheorghiu and J.A. Brzozowski, “Feedback-free circuits in the algebra of transients,” in 7th Int. Conf. on Implementation and Application of Automata, Tours, France, July 2002. Lecture Notes in Computer Science, vol. 2608, Springer 2003, pp. 106–116.

    Google Scholar 

  16. M. Goto, “Application of three-valued logic to construct the theory of relay networks” (in Japanese), in Proceedings of the Joint Meeting of IEE, IECE, and I.of Illumination E. of Japan, 1948.

  17. G. Grätzer, Universal Algebra, 2nd ed., Springer-Verlag, 1979.

  18. J.P. Hayes, “Digital simulation with multiple logic values,” IEEE Trans. on Computer-Aided Design, Vol.CAD-5, No. 2, 1986.

  19. D.W. Lewis, “Hazard detection by a quinary simulation of logic devices with bounded propagation delays,” MSc Thesis, Electrical Engineering, Syracuse University, Syracuse, NY, Jan. 1972.

  20. D.E. Muller, “A theory of asynchronous circuits,” Technical Report 66, Digital Computer Laboratory, University of Illinois, Urbana-Champaign, Illinois, USA, 1955.

  21. D.E. Muller and W.S. Bartky, “A theory of asynchronous circuits,” in Proceedings of an International Symposium on the Theory of Switching, Annals of the Computation Laboratory of Harvard University, Harvard University Press, 1959, pp. 204–243.

  22. A. Salomaa, Theory of Automata, Pergamon Press, Oxford, 1969.

    Google Scholar 

  23. S.H. Unger, Asynchronous Sequential Switching Circuits, Wiley-Interscience, 1969.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brzozowski, J., Ésik, Z. Hazard Algebras. Formal Methods in System Design 23, 223–256 (2003). https://doi.org/10.1023/A:1026218512171

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026218512171

Navigation