Complexity Issues of Ternary Boolean Diagrams
Title:Complexity Issues of Ternary Boolean Diagrams
Speaker: Prof. Wenhui Zhang (SKLCS, Institute of Software, Chinese Academy of Sciences)
Time: 10:00am, November 11th (Friday), 2011
Venue:Lecture Room, Level 3, Building No. 5, State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences
Abstract: Ternary Boolean diagrams (TBDs) has been used for representation of sets of states for model checking purposes. The advantage of Ternary Boolean diagrams is that it may represent sets of states more compactly than traditional decision diagrams. This talk will explain the representation succinctness of TBDs relative to that of BDDs.