Dynamic Boolean Algebras

Authors:
S. Leinward;T. Lamdan
Affiliations:
Department of Applied Mathematics, The Weizmann Institute of Science;-
Venue:
IEEE Transactions on Computers
Year:
1980

Citing 6
Cited 1

Application of Ternary Algebra to the Study of Static Hazards

Journal of the ACM (JACM)
Design verification based on functional abstraction

DAC '79 Proceedings of the 16th Design Automation Conference
Boolean Differential Calculus and its Application to Switching Theory

IEEE Transactions on Computers
Synthesis of Multiple-Input Change Asynchronous Circuits Using Transition-Sensitive Flip-Flops

IEEE Transactions on Computers
An Algebraic Model for the Analysis of Logical Circuits

IEEE Transactions on Computers
Analysis and Synthesis of Asynchronous Sequential Networks Using Edge-Sensitive Flip-Flops

IEEE Transactions on Computers

Design verification based on functional abstraction

DAC '79 Proceedings of the 16th Design Automation Conference

Quantified Score

Hi-index	14.98

Visualization

Abstract

Switching algebra is unable to represent the dynamic behavior of digital circuits. There are several known methods for modeling the dynamics of circuits, using either multivalued algebras or specialized operators. None of them preserves the framework of switching algebra; therefore, existing analysis and synthesis methods developed by switching theory cannot be used.