计算机工程与应用Issue(17)：20-23,4.DOI:10.3778/j.issn.1002-8331.1312-0067
同一变量排序下的多OBDD合并算法
Multiple OBDD merging algorithm under same variable ordering
摘要
Abstract
Ordered Binary Decision Diagrams(OBDD)is a Boolean function representation data structure, and has been applied in many fields. In dynamic or distribute environment, how to efficiently build OBDD of the target Boolean expres-sion form the known Boolean expression’s OBDD is a frequent encountered problem. Under identical variable ordering, this paper puts forward a OBDD merging algorithm based on Shannon decomposition principle. In the algorithm, it firstly establishes a storage table for the target Boolean expression, and then under the reverse variable ordering it handles each variable in turn, and combines the rows with same values, until all the variables are handled.关键词
有序决策图(OBDD)/同一变量排序/多有序决策图(OBDD)合并/Apply算法Key words
Ordered Binary Decision Diagrams(OBDD)/identical variable ordering/multiple Ordered Binary Decision Diagrams(OBDD)merging/Apply algorithm分类
信息技术与安全科学引用本文复制引用
智慧来..同一变量排序下的多OBDD合并算法[J].计算机工程与应用,2014,(17):20-23,4.基金项目
国家自然科学基金（No.60975033）；河南理工大学博士基金（No.B2011-102）。 （）
