Justification Equivalence

Abstract

Justification in logic circuits is fundamental to many areas of very large scale integrated (VLSI) circuit design, such as test generation, logic synthesis, logic verification, and redundancy identification. It can be described as a decision-making search process traversing the decision spaces, which are defined by logic circuits, to find solutions satisfying the specified objectives. In general, justification in logic circuits belongs to the class of NP-complete problems, meaning that no polynomial time solution exists.