Graph representations of the sets of all reachable reactions of the combinational circuit

The problem of obtaining the set of all achievable reactions of a combinational logic circuit is considered. An algorithm for constructing a ROBDD graph representing all the achievable reactions of the circuit is proposed. The resulting graph contains internal vertices, which are labeled only with schema output variables. The algorithm can be used in cases where an ROBDD graph that depends on input and output variables cannot be obtained because of the exponential growth of the number of vertices. Contribution of the authors: the authors contributed equally to this article. The authors declare no conflicts of interests.

Keywords

Authors

References