Abstract:

The scale of ordered binary decision diagrams (OBDDs) increases exponentially with the number of variables. In this paper, to overcome the difficulties of describing and storing large scale OBDDs data, we propose a data structure of shared OBDDs with complemented edges, in which a set of key attributes of nodes are defined. This data structure merges the features of shared OBDDs and OBDDs with complemented edges. At last, a contrastive analysis of space consuming experiment is carried out to demonstrate that this data structure can describe and store large scale OBDDs data effectively.

Key words: large scale OBDDs;shared OBDDs;complemented edges;data structures