On The Complexity Of The Evaluation Of Transient Extensions Of Boolean Functions
MetadataShow full item record
Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients. Formulas for computing the output transient of a gate from the input transients are known for NOT, AND, OR and XOR gates and their complements, but, in general, even the problem of deciding whether the length of the output transient exceeds a given bound is NP-complete. We propose a method of evaluating extensions of general boolean functions. We study a class of functions for which, instead of evaluating the extensions on a given set of transients, it is possible to get the same values by using transients derived from the given ones, but having length at most 3. We prove that all functions of three variables, as well as certain other functions, have this property, and can be efficiently evaluated.
Cite this work
Janusz A. Brzozowski, Baiyu Li, Yuli Ye (2012). On The Complexity Of The Evaluation Of Transient Extensions Of Boolean Functions. UWSpace. http://hdl.handle.net/10012/12516