cuddClip.c File Reference

Clipping functions. More...

#include "util.h"
#include "cuddInt.h"

Include dependency graph for cuddClip.c:

Functions
DdNode *	Cudd_bddClippingAnd (DdManager *dd, DdNode *f, DdNode *g, int maxDepth, int direction)
	Approximates the conjunction of two BDDs f and g. More...
DdNode *	Cudd_bddClippingAndAbstract (DdManager *dd, DdNode *f, DdNode *g, DdNode *cube, int maxDepth, int direction)
	Approximates the conjunction of two BDDs f and g and simultaneously abstracts the variables in cube. More...
DdNode *	cuddBddClippingAnd (DdManager *dd, DdNode *f, DdNode *g, int maxDepth, int direction)
	Approximates the conjunction of two BDDs f and g. More...
DdNode *	cuddBddClippingAndAbstract (DdManager *dd, DdNode *f, DdNode *g, DdNode *cube, int maxDepth, int direction)
	Approximates the conjunction of two BDDs f and g and simultaneously abstracts the variables in cube. More...
static DdNode *	cuddBddClippingAndRecur (DdManager *manager, DdNode *f, DdNode *g, int distance, int direction)
	Implements the recursive step of Cudd_bddClippingAnd. More...
static DdNode *	cuddBddClipAndAbsRecur (DdManager *manager, DdNode *f, DdNode *g, DdNode *cube, int distance, int direction)
	Approximates the AND of two BDDs and simultaneously abstracts the variables in cube. More...

Detailed Description

Clipping functions.

Author

Fabio Somenzi

Copyright

Copyright (c) 1995-2015, Regents of the University of Colorado

All rights reserved.

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.

Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

Neither the name of the University of Colorado nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

Function Documentation

Cudd_bddClippingAnd()

DdNode* Cudd_bddClippingAnd	(	DdManager *	dd,
		DdNode *	f,
		DdNode *	g,
		int	maxDepth,
		int	direction
	)

Approximates the conjunction of two BDDs f and g.

Returns

a pointer to the resulting BDD if successful; NULL if the intermediate result blows up.

Side effects None

See also

Cudd_bddAnd

Parameters

dd	manager
f	first conjunct
g	second conjunct
maxDepth	maximum recursion depth
direction	under (0) or over (1) approximation

Cudd_bddClippingAndAbstract()

DdNode* Cudd_bddClippingAndAbstract	(	DdManager *	dd,
		DdNode *	f,
		DdNode *	g,
		DdNode *	cube,
		int	maxDepth,
		int	direction
	)

Approximates the conjunction of two BDDs f and g and simultaneously abstracts the variables in cube.

The variables are existentially abstracted.

Returns

a pointer to the resulting BDD if successful; NULL if the intermediate result blows up.

Side effects None

See also

Cudd_bddAndAbstract Cudd_bddClippingAnd

Parameters

dd	manager
f	first conjunct
g	second conjunct
cube	cube of variables to be abstracted
maxDepth	maximum recursion depth
direction	under (0) or over (1) approximation

cuddBddClipAndAbsRecur()

static DdNode* cuddBddClipAndAbsRecur ( DdManager *  manager, DdNode *  f, DdNode *  g, DdNode *  cube, int  distance, int  direction  )

static

Approximates the AND of two BDDs and simultaneously abstracts the variables in cube.

The variables are existentially abstracted.

Returns

a pointer to the result is successful; NULL otherwise.

Side effects None

See also

Cudd_bddClippingAndAbstract

cuddBddClippingAnd()

DdNode* cuddBddClippingAnd	(	DdManager *	dd,
		DdNode *	f,
		DdNode *	g,
		int	maxDepth,
		int	direction
	)

Approximates the conjunction of two BDDs f and g.

Returns

a pointer to the resulting BDD if successful; NULL if the intermediate result blows up.

Side effects None

See also

Cudd_bddClippingAnd

Parameters

dd	manager
f	first conjunct
g	second conjunct
maxDepth	maximum recursion depth
direction	under (0) or over (1) approximation

cuddBddClippingAndAbstract()

DdNode* cuddBddClippingAndAbstract	(	DdManager *	dd,
		DdNode *	f,
		DdNode *	g,
		DdNode *	cube,
		int	maxDepth,
		int	direction
	)

Approximates the conjunction of two BDDs f and g and simultaneously abstracts the variables in cube.

Returns

a pointer to the resulting BDD if successful; NULL if the intermediate result blows up.

Side effects None

See also

Cudd_bddClippingAndAbstract

Parameters

dd	manager
f	first conjunct
g	second conjunct
cube	cube of variables to be abstracted
maxDepth	maximum recursion depth
direction	under (0) or over (1) approximation

cuddBddClippingAndRecur()

static DdNode* cuddBddClippingAndRecur ( DdManager *  manager, DdNode *  f, DdNode *  g, int  distance, int  direction  )

static

Implements the recursive step of Cudd_bddClippingAnd.

Takes the conjunction of two BDDs.

Returns

a pointer to the result is successful; NULL otherwise.

Side effects None

See also

cuddBddClippingAnd