BDD101(1) ALLIANCE BDD LIBRARY BDD101(1)

# NAME¶

bdd - Mutli Reduced Ordered Binary Decision Diagrams

# ORIGIN¶

This software belongs to the ALLIANCE CAD SYSTEM developed by the ASIM team at LIP6 laboratory of Université Pierre et Marie CURIE, in Paris, France.

Web : http://asim.lip6.fr/recherche/alliance/
E-mail : alliance-users@asim.lip6.fr

# DESCRIPTION¶

bdd is a library that enables to represent a boolean expression as a Multi Reduced Ordered Binary Decision Diagrams.
viewbddallocinfo - displays memory informations.

- complements a bdd.
- applies an operator on two bdd nodes.
- applies an operator on two bdd nodes.
- computes the IF-THEN-ELSE logical operation.
- applies an opertor to a bdd nodes list.
- creates a new association variables.
- adds a bdd node in a variable association.
- deletes a variable association.
- deletes a bdd node in a variable association.
- frees all the variable associations.
- displays variable associations.
- checks the coherence of a variable.
- checks the coherence of a bdd index.
- ckecks the coherence of an operator.
- checks a variable association.
- checks if the max node reached.
- creates a bdd circuit.
- resets a bdd circuit.
- frees a bdd circuit.
- searches a specified input in a circuit.
- adds a new input in a circuit.
- adds an auxialiary variable in a circuit.
- searches a specified output in a circuit.
- adds a new output in a circuit.
- deletes a specified output in a circuit.
- converts an abl to a bdd node.
- converts a bdd node to an abl.
- converts a bdd node to an abl.
- displays a bdd circuit.
- computes the generalized cofactor.
- substitutes a variable by zero or one.
- substitutes a variable by a bdd node.
- converts a bdd index to an atomic abl.
- converts a bdd node to a multiplexor.
- converts a bdd node to an abl.
- converts a bdd node to an abl.
- computes an existantial quantification.
- computes an existantial quantification.
- forces a bdd garbage collection.
- computes a bdd that implies a conjonction.
- tests for an intersection.
- marks a bdd node.
- clears a marked bdd node.
- gets the number of nodes in a bdd.
- gets the number of nodes in a bdd.
- adds a new bdd node.
- adds a node in a chain_list.
- deletes a bdd node.
- deletes a list of bdd nodes.
- displays a bdd node.
- increments the number of external reference.
- increments the number of internal reference.
- decrements the number of external reference.
- decrements the number of internal reference.
- sets a node visible from outside.
- sets a node invisible from outside.
- clears all the internal references.
- clears all the external references.
- clears all the references.
- computes a relation product.
- reorders the bdd nodes.
- reorders the bdd nodes.
- reorders the bdd nodes.
- sets the dynamic reorder parameters.
- finds a satisfying path for a bdd.
- simplifies a bdd with don't cares on its on-set.
- simplifies a bdd with don't cares on its off-set
- substitutes variables with bdd nodes.
- gives the support of a bdd node.
- checks if a variable appears in a bdd node.
- creates a bdd system.
- resets a bdd system.
- frees a bdd system.
- displays a bdd system.
- displays statisticals informations.
- debbugs a bdd circuit.
- creates a new variable.
- creates a new variable.
- creates a new variable.
- creates a new variable.
- creates a new variable.
- sweeps all the unused nodes for a variable.
- swaps two contigous variables.
- converts bdd index to a variable number.
- converts a variable number in a bdd index.
- gives the bdd node of a variable.
- gives the bdd node of a variable.
- creates an auxiliary variable.
- creates an auxiliary variable.