Ddi_DdArray_t * 
Part_DdArrayMultiwayLinearAndExist(
  Ddi_DdArray_t * Fa, Array of BDDs
  Ddi_VarSet_t * smoothV, Var Set
  int  threshold, Size threshold for result factor
  int  verbosity Level of verbosity
)
The function computes the following operation:

Exist (smoothV) ( f1*f2*f2* ... *fn )

where f1,f2,..fn are elements of a array's function (DdArray), and smoothV are variables that must be abstracted.
Although existential abstraction does not distribute over conjunction, function can be moved out of the scope of an existential quantification if they do not depend on any of the variables being quantified.
This method is called early quantification or early smooth.

Side Effects none


Ddi_Dd_t * 
Part_DdDisjSuppPart(
  Ddi_Dd_t * f, a BDD
  Ddi_Dd_t * TR, a Clustered Transition Relation
  Ddi_VarArray_t * psv, array of present state variables
  Ddi_VarArray_t * nsv, array of next state variables
  int  verbosity level of verbosity
)

Side Effects none


Ddi_Dd_t * 
Part_DdMultiwayLinearAndExist(
  Ddi_Dd_t * FPart, Input partitioned function
  Ddi_VarSet_t * smoothV, Var Set
  int  threshold, Size threshold for result factor
  int  verbosity, Level of verbosity
  int * sizeMaxP Pointer to Size Max
)
Compute the multiway and-exist over a conjunctively partitioned function

Side Effects none


int 
Part_EstimateCofactorComplex(
  Ddi_Dd_t * f, Input BDD
  Ddi_Dd_t * topVar Top Variable
)
Counts the number of nodes of the cofactors: Fabio Somenzi Private Commnunication Solution.

Side Effects none

See Also partEstimateCofactor

int 
Part_EstimateCofactorFast(
  Ddi_Dd_t * f, 
  int  LeftRight, 
  Ddi_VarSet_t * supp, 
  int  suppSize, 
  int * totalArray, 
  int * thenArray, 
  int * elseArray 
)
Count the number of nodes of the cofactors using the fast heuristic (TCAD'99)

Side Effects None


int 
Part_EstimateCofactorFreeOrder(
  Ddi_Dd_t * f, Input BDD
  Ddi_Dd_t * topVar, Top Variable
  Ddi_VarSet_t * supp, 
  int * vet 
)
Count the number of nodes of the cofactors using the Free Order heuristic (TCAD'99).

Side Effects None


int 
Part_EstimateCofactor(
  Ddi_Dd_t * f, Input BDD
  Ddi_Dd_t * topVar Top Variable
)
Counts the number of nodes of the cofactors: Stefano Quer solution.

Side Effects None

See Also partEstimateCofactor

char * 
Part_MethodEnum2String(
  Part_Method_e  enumType 
)
Given an Enumerated type Returns a string.

Side Effects none

See Also Part_MethodString2Enum

Part_Method_e 
Part_MethodString2Enum(
  char * string String to Analyze
)
It receives a string; to facilitate the user that string can be an easy-to-remember predefined code or an integer number (interpreted as a string). It returns the verbosity enumerated type.

Side Effects none

See Also Part_MethodEnum2String

Ddi_Dd_t * 
Part_PartitionDisjSet(
  Ddi_Dd_t * f, Input BDD
  Ddi_VarSet_t * careVars, Set of Vars
  Part_Method_e  partitionMethod, Partition Method
  int  threshold, Threshold Size
  Pdtutil_VerbLevel_e  verbosity Verbosity Level
)
Partition a state set

Side Effects none

See Also Trav_Traversal partPartitionDisjSet

Ddi_Dd_t * 
Part_PartitionSetCudd(
  Ddi_Dd_t * f, Input BDD
  Part_Method_e  partitionMethod, Partition Method
  int  threshold, Threshold Size
  Pdtutil_VerbLevel_e  verbosity Verbosity Level
)
This function derives from the Part_PartitionDisjSet function. It is rewritten here for two reasons:

Side Effects none


Ddi_Dd_t * 
Part_PartitionSetInterface(
  Ddi_Dd_t * f, Input BDD
  Ddi_VarSet_t * careVars, Set of Vars
  Part_Method_e  partitionMethod, Partition Method
  int  threshold, Threshold Size
  Pdtutil_VerbLevel_e  verbosity Verbosity Level
)
It calls Part_PartitionDisjSet (to partition a BDD using "internal" routines) or Part_PartitionSetCudd (to partition a BDD using the CUDD routines.

Side Effects none

See Also Trav_Traversal partPartitionDisjSet

Last updated on 990617 11h53