Boolean Function Representations

Abstract

AbstractIn this chapter we review the function representations that will be used throughout the book. We begin by introducing the classical function forms such as truth tables and Boolean equations. Then, through Shannon expansions we present decision diagrams, including word-level decision diagrams (WLDDs). We conclude the chapter with spectral methods, which play a fundamental role in our verification method. Among others, we introduce Arithmetic Transform, which forms the basis for error representation and test vector generation in our verification scheme.KeywordsBoolean FunctionTruth TableConjunctive Normal FormBinary Decision DiagramSatisfying AssignmentThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.