Logic properties of unate and of symmetric discrete functions
MVL '76 Proceedings of the sixth international symposium on Multiple-valued logic
A Unified Approach to Combinational Hazards
IEEE Transactions on Computers
Elimination of static and dynamic hazards in combinational switching circuits
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Hazard detection in combinational and sequential switching circuits
IBM Journal of Research and Development
Multiple-Valued Logic: An Introduction and Overview
IEEE Transactions on Computers
| Hi-index | 14.98 |
The total and local unateness of discrete and of switching functions are studied from a theoretical point of view. One shows that the local unateness leads to the concept of hazard-free transition for a discrete function. Unate covers for discrete functions are defined: they are either the smallest unate functions larger than a discrete function, or the largest unate functions smaller than a discrete function. These concepts play a key role in hazard-free design of multiple-valued networks. Three-level types of multiple-valued networks using MIN and MAX gates are presented. These networks improve, from a hazard point of view the well known two-level networks presented by Eichel-berger in the frame of switching theory.