Hazard algebras (extended abstract)
A half-century of automata theory
Asynchronous Sequential Switching Circuit
Asynchronous Sequential Switching Circuit
Theory of Automata
More Accurate Polynomial-Time Min-Max Timing Simulation
ASYNC '97 Proceedings of the 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems
ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
Beyond two
Simulation of gate circuits in the algebra of transients
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Feedback-free circuits in the algebra of transients
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Abstract interpretation of combinational asynchronous circuits
Science of Computer Programming
Simulation of gate circuits in the algebra of transients
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Feedback-free circuits in the algebra of transients
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Soft-error tolerance and mitigation in asynchronous burst-mode circuits
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
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.