Dynamic Boolean Algebras
- 1 October 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-29 (10) , 950-953
- https://doi.org/10.1109/tc.1980.1675483
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.Keywords
This publication has 8 references indexed in Scilit:
- Design Verification Based on Functional AbstractionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- An Algebraic Model for the Analysis of Logical CircuitsIEEE Transactions on Computers, 1974
- Synthesis of Multiple-Input Change Asynchronous Circuits Using Transition-Sensitive Flip-FlopsIEEE Transactions on Computers, 1973
- Boolean Differential Calculus and its Application to Switching TheoryIEEE Transactions on Computers, 1973
- Analysis and Synthesis of Asynchronous Sequential Networks Using Edge-Sensitive Flip-FlopsIEEE Transactions on Computers, 1971
- Application of Ternary Algebra to the Study of Static HazardsJournal of the ACM, 1964
- On a Theory of Boolean FunctionsJournal of the Society for Industrial and Applied Mathematics, 1959
- Treatment of transition signals in electronic switching circuits by algebraic methodsIRE Transactions on Electronic Computers, 1959