Implicit and incremental computation of primes and essential primes of Boolean functions

Recently introduced implicit set manipulation techniques have made it possible to formally verify finite state machines with state graphs too large to be built. The authors show that these techniques can also be used with success to compute and manipulate implicitly large sets of prime and of essent...

Full description

Saved in:
Bibliographic Details
Published in[1992] Proceedings 29th ACM/IEEE Design Automation Conference pp. 36 - 39
Main Authors Coudert, O., Madre, J.C.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1992
Subjects
Automata
Binary decision diagrams
Boolean functions
Computational efficiency
Costs
Data structures
Equations
Online AccessGet full text
ISBN9780818628221
0818628227
ISSN0738-100X
DOI10.1109/DAC.1992.227866

Cover

More Information
Summary:Recently introduced implicit set manipulation techniques have made it possible to formally verify finite state machines with state graphs too large to be built. The authors show that these techniques can also be used with success to compute and manipulate implicitly large sets of prime and of essential prime implicants of incompletely specified Boolean functions. These sets are denoted by meta-products that are represented with binary decision diagrams (BDDs). Two procedures are described. The first is based on the standard BDD operators, and the second, more efficient, takes advantage of the structural properties of BDDs and of meta-products to handle a larger class of functions than the first procedure.< >
ISBN:9780818628221
0818628227
ISSN:0738-100X
DOI:10.1109/DAC.1992.227866