Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1986: Automata, Languages and Programming pp 69–78Cite as

Correspondence between ternary simulation and binary race analysis in gate networks

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 226))

Abstract

Ternary simulation techniques provide efficient methods for the analysis of the behavior of VLSI circuits. However, the results of ternary simulation have not been completely characterized. In this paper we outline the proof of the Brzozowski-Yoeli conjecture (stated in 1976) that the results of the ternary simulation of a gate network N correspond to the results of the binary race analysis of Ñ in the “Multiple-winner” model, where Ñ is the network N in which a delay has been inserted in each wire.

(Extended Summary)

This research was supported by the Natural Sciences and Engineering Research Council of Canada under grant A0871.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.E. Bryant, “A Switch-Level Model and Simulator for MOS Digital Systems”, IEEE Transactions on Computers, Vol. C-33, No. 2, Feb. 1984.

    Google Scholar 

  2. R.E. Bryant, “Race Detection in MOS Circuits by Ternary Simulation”, In F. Anceau and E.J. Aas (eds.), VLSI '83, pp. 85–95, Elsevier Science Publishers B. V. (North-Holland).

    Google Scholar 

  3. R.E. Bryant, “Toward a Proof of the Brzozowski-Yoeli Conjecture on Ternary Simulation”, Unpublished manuscript, Dec. 1983.

    Google Scholar 

  4. J.A. Brzozowski and C-J. Seger, “A Characterization of Ternary Simulation of Gate Networks”, Research Report CS-85-37, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, Oct. 1985.

    Google Scholar 

  5. J.A. Brzozowski and M. Yoeli, “On a Ternary Model of Gate Networks”, IEEE Transactions on Computers, Vol. C-28, No. 3, pp. 178–183, Mar. 1979.

    Google Scholar 

  6. E.B. Eichelberger, “Hazard Detection in Combinational and Sequential Switching Circuits”, IBM J. Res. Dev., Vol. 9, pp. 90–99, Mar. 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    J. A. Brzozowski

Authors
  1. J. A. Brzozowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C-J. Seger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Kott

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brzozowski, J.A., Seger, CJ. (1986). Correspondence between ternary simulation and binary race analysis in gate networks. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-16761-7_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16761-7

  • Online ISBN: 978-3-540-39859-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation