Boolean Functions

  • Thomas Kropf


A Boolean function f is a mapping f:{F,T}n→{F,T},i.e.,the image of the function is a set containing only two elements, T and F.1 Although these functions are not very expressive they play a crucial role in hardware verification.


Boolean Function Propositional Logic Function Table Binary Decision Diagram Combinational Circuit 
These 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Thomas Kropf
    • 1
    • 2
  1. 1.Department K8/DIC3Robert Bosch GmbHReutlingenGermany
  2. 2.Wilhelm Schickard Institute of Computer ScienceUniversity of TübingenTübingenGermany

Personalised recommendations