Hostname: page-component-848d4c4894-nr4z6 Total loading time: 0 Render date: 2024-06-08T10:23:03.082Z Has data issue: false hasContentIssue false
  • English
  • Français

Gate circuits in the algebra of transients

Published online by Cambridge University Press:  15 March 2005

Janusz Brzozowski  and
Mihaela Gheorghiu
Janusz Brzozowski
Affiliation:
School of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada; brzozo@uwaterloo.ca
Mihaela Gheorghiu
Affiliation:
Department of Computer Science, University of Toronto, Toronto, ON, M5S 3G4, Canada; mg@cs.toronto.edu
Get access

Abstract


We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating 0s and 1s; it represents a changing signal. In the algebra of transients, gates process transients instead of 0s and 1s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if the initial state is stable. We show that the two algorithms agree in the stable case. We also show that the general algorithm is insensitive to the removal of state variables that are not feedback variables. We prove the sufficiency of simulation: all signal changes occurring in binary analysis are predicted by the general algorithm. Finally, we show that simulation can be more pessimistic than binary analysis, if wire delays are not taken into account. We propose a circuit model that we conjecture to be sufficient for proving the equivalence of simulation and binary analysis for feedback-free circuits.


Keywords

Algebradigital circuithazard detectionsignal changessimulationtransient.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 39 , Issue 1: Imre Simon, the tropical computer scientist , January 2005 , pp. 67 - 91
Copyright
© EDP Sciences, 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ann. Symp. Asynchronous Circuits and Systems, Proc. 9th (ASYNC '03), IEEE Comp. Soc. (2003).
Brzozowski, J.A. and Ésik, Z., Hazard algebras. Formal Methods in System Design 23 (2003) 223–256. CrossRef
J.A. Brzozowski, Z. Ésik and Y. Iland, Algebras for hazard detection. Beyond Two: Theory and Applications of Multiple-Valued Logic, edited by M. Fitting and E. Orłowska. Physica-Verlag (2003) 3–24.
Brzozowski, J.A. and Gheorghiu, M., Simulation of gate circuits in the algebra of transients. Implementation and Application of Automata. Lect. Notes Comput. Sci. 2608 (2003) 57–66. CrossRef
J.A. Brzozowski and C.-J.H. Seger, Asynchronous circuits. Springer-Verlag (1995).
J.A. Brzozowski and C.-J.H. Seger, A characterization of ternary simulation of gate networks. IEEE Trans. Comp. C-36 (1987) 1318–1327.
J.A. Brzozowski and M. Yoeli, On a ternary model of gate networks. IEEE Trans. Comp. C-28 (1979) 178–183.
Eichelberger, E.B., Hazard detection in combinational and sequential circuits. IBM J. Res. Dev. 9 (1965) 90–99. CrossRef
J.D. Garside, AMULET3 revealed, in Proc. 5th Ann. Symp. Asynchronous Circuits and Systems (ASYNC '99), IEEE Comp. Soc. (1999) 51–59.
M. Gheorghiu, Circuit simulation using a hazard algebra. MMath Thesis, Department of Computer Science, University of Waterloo, Waterloo, ON, Canada (2001).
Gheorghiu, M. and Brzozowski, J.A., Simulation of feedback-free circuits in the algebra of transients. Int. J. Found. Comput. Sci. 14 (2003) 1033–1054. CrossRef
J. Kessels and P. Marston, Designing asynchronous standby circuits for a low-power pager, in Proc. 3rd Ann. Symp. Asynchronous Circuits and Systems (ASYNC '97), IEEE Comp. Soc. (1997) 268–278.
E.J. McCluskey, Transients in combinational logic circuits. Redundancy techniques for computing systems, edited by R.H. Wilcox and W.C. Mann. Spartan Books (1962) 9–46.
D.E. Muller and W.C. Bartky, A theory of asynchronous circuits, in Proc. Int. Symp. on Theory of Switching, Annals of Comp. Lab. Harvard University 29 (1959) 204–243.
Seger, C.-J.H. and Brzozowski, J.A., Generalized ternary simulation of sequential circuits. Theor. Inf. Appl. 28 (1994) 159–186. CrossRef
Sutherland, I.E. and Ebergen, J., Computers without Clocks. Sci. Amer. 287 (2002) 62–69. CrossRef
S.H. Unger, Asynchronous sequential switching circuits. John Wiley & Sons (1969).