INTERVAL EXTENSIONS OF BOOLEAN FUNCTIONS AND THREE-VALUE SIMULATION OF SEQUENTIAL CIRCUITS
In this paper, the notion of the interval extension of a Boolean function is considered, which allows determining the values of function on intervals of Boolean vectors. The task of exact three-value simulation of combinational and sequential circuits can be considered as a task of calculating the values of interval extensions of Boolean functions and logical automata, correspondingly. The general rules of exact step-by-step three-value simulation of synchronous sequential circuits based on the transition functions to states are presented. The previously proposed method of three-value simulation for DNF representation of functions is based on these rules. The method was later converted into the ROBDD representation of the functions. In addition, in this paper, the previously proposed method of exact step-by-step three-value simulation using the ROBDD representation of functions is transformed to a more universal form.