象征性的布尔操作的有序二元决策.pptVIP

Binary Decision DiagramsandSymbolic Model Checking Binary Decision Diagrams Restricted Form of Branching Program Graph representation of Boolean function Canonical form Simple algorithms to construct manipulate Application Niche Problems expressed as Quantified Boolean Formulas A lot of interesting problems are in PSPACE Symbolic Model Checking Prove properties about large-scale, finite-state system Successfully used to verify hardware systems Boolean Function as Language View n-variable Boolean function as language ? {0,1}n Reduced DFA is canonical representation From DFA to OBDD Canonical representation of Boolean function Two functions equivalent if and only if graphs isomorphic Desirable property: simplest form is canonical. Representing Circuit Functions Functions All outputs of 4-bit adder Functions of data inputs Effect of Variable Ordering Sample Function Classes General Experience Many tasks have reasonable OBDD representations Algorithms remain practical for up to 500,000 node OBDDs Heuristic ordering methods generally satisfactory Symbolic Manipulation with OBDDs Strategy Represent data as set of OBDDs Identical variable orderings Express solution method as sequence of symbolic operations Sequence of constructor query operations Similar style to on-line algorithm Implement each operation by OBDD manipulation Do all the work in the constructor operations Key Algorithmic Properties Arguments are OBDDs with identical variable orderings Result is OBDD with same ordering Each step polynomial complexity If-Then-Else Operation Concept Basic technique for building OBDD from logic network or formula. If-Then-Else Execution Example Optimizations Dynamic programming Early termination rules If-Then-Else Result Generation Recursive calling structure implicitly defines unreduced BDD Apply reduction rules bottom-up as return from recursive calls Restriction Operation Concept Effect of setting function argument xi to constant k (0 or 1). Also called Cofactor