J. Jain
ABSTRACT
We discuss an open problem in construction of Reduced Ordered Binary Decision Diagrams (ROBDDs) using composition, and prove that the worst case complexity of the construction is truly cubic. With this insight we show that the process of composition naturally leads to the construction of (even exponentially) compact partitioned-OBDDs (POBDDs) [12]. Our algorithm which incorporates dynamic partitioning, leads to the most general (and compact) form of POBDDs - graphs with multiple root variables. To show that our algorithm is robust and practical, we have analyzed some well known problems in Boolean function representation, verification and finite state machine analysis where our approach generates graphs which are even orders of magnitude smaller.
- 1.J. Burch, E. Clarke, K. McMillan, and D. Dill. "Sequential Circuit Verification Using Symbolic Model Checking". Proc. 27th DAC, pages 46-51, 1990. Google Scholar
Digital Library
- 2.J. Gergov and C. Meinel. "Efficient Boolean Manipulation with OB- DDs can be extended to FBDDs". IEEE Trans. on Computers 43, pages 1197-1209,1994. Google ScholarDigital Library
- 3.B. Bollig and I. Wegener. "Partitioned BDDs vs. Other BDD Models" Proc. IWLS, 1997.Google Scholar
- 4.R.E. Bryant. "Graph-based Algorithms for Boolean Function Manipulation". IEEE Transactions on Computers, C-35:677-691, August 1986. Google ScholarDigital Library
- 5.R.E. Bryant. "Symbolic boolean manipulation with ordered binary decision diagrams". ACM Computing Surveys, 24:293-318, September 1992. Google ScholarDigital Library
- 6.G. Cabodi, P. Camurati, and S. Quer. "Efficient State Space Pruning in Symbolic Backward Traversal". Proc. ICCD, pages 230-235, 1994. Google ScholarDigital Library
- 7.G. Cabodi, S. Quer, and P. Camurati. "Extending Equivalence Class Computation to Large FSMs". Proc. ICCD, pages 258-263, 1995. Google ScholarDigital Library
- 8.O. Coudert, C. Berthet, and J. Madre. "Verification of Sequential Machines Using Boolean Functional Vectors". Formal VLSI Correctness Verification. Elsevier Sc., pages 179-196, 1990.Google Scholar
- 9.R. Drechsler et. al. Efficient representation and manipulation of switching functions based on Ordered Kronecker Functional Decision Diagrams. DAC, 1994. Google ScholarDigital Library
- 10.Y.V. Hoskote. "Formal Techniques for Verification of Synchronous Sequential Circuits". Ph.D Dissertation, Dept. of Electrical and Computer Engineering, The University of Texas at Austin, 1995.Google Scholar
- 11.S.-Y. Huang, K.-T Cheng, K.-C. Chen, and U. Glaeser. "An ATPG- based Framework for Verifying Sequential Equivalence". Proc. ITC, pages 865-874, 1996. Google ScholarDigital Library
- 12.J. Jain, J. Bitner, D. S. Fussell, and J. A. Abraham. "Functional partitioning for verification and related problems". Brown/MIT VLSI Conference, March 1992.Google Scholar
- 13.J. Jain. "On Analysis of Boolean Functions". Ph.D Dissertation, Dept. of Electrical and Computer Engineering, The University of Texas at Austin, 1993. Google ScholarDigital Library
- 14.J. Jain, A. Narayan, C. Coelho, S. Khatri, A. Sangiovanni-Vincentelli, R. Brayton, and M. Fujita. "Decomposition Techniques for Efficient ROBDD Construction". In Formal Methods in CAD 96, LNCS. Springer-Verlag, 1996. Google ScholarDigital Library
- 15.Z. Kohavi. "Switching and Finite Automata Theory". McGraw-Hill Book Company, 1978. Google ScholarDigital Library
- 16.A. Narayan, S.P. Khatri, J. Jain, M. Fujita, R. K. Brayton, and A. Sangiovanni-Vincentelli. "A Study of Composition Schemes for Mixed Apply-Compose based Construction of ROBDDs". Proc. VLSI Design, pages 249-253, 1996. Google ScholarDigital Library
- 17.A. Narayan, J. Jain, M. Fujita, and A. L. Sangiovanni-Vincentelli. "Partitioned-ROBDDs - A Compact, Canonical and Efficiently Manipulable Representation for Boolean Functions". ICCAD, November 1996. Google ScholarDigital Library
- 18.A. Narayan, A. Isles, J. Jain, R. Brayton, and A. Sangiovanni- Vincentelli. "Reachability Analysis Using Partitioned-ROBDDs" Proc. ICCAD, pages 388-393, 1997. Google ScholarDigital Library
- 19.C. Pixley. "A Theory and Implementation of Sequential Hardware Equivalence". IEEE Trans. on CAD, pages 1469-1494, 1992.Google ScholarDigital Library
- 20.C. Pixley, V. Singhal, A. Aziz, and R. K. Brayton. "Multi-level Synthesis for Safe Replaceability". Proc. ICCAD, pages 442-449, 1994. Google ScholarDigital Library
- 21.R. Mukherjee, J. Jain, K. Takayama, M. Fujita, J. Abraham, and D. Fussell. "An Efficient Filter-based Approach for Combinational Verification". IEEE Transactions on Computer-Aided Design, Vol-18, Pages 1542-1557, November 1999. Google ScholarDigital Library
- 22.D. Sieling and I. Wegener "NC-Algorithms for Operations on Binary Decision Diagrams". Parallel Processing Letters, 3:3-12, 1993.Google ScholarCross Ref
Index Terms
- Analysis of composition complexity and how to obtain smaller canonical graphs
Recommendations
L(2,1)-Labelings on the composition of n graphs
An L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(x)-f(y)|>=2 if d(x,y)=1 and |f(x)-f(y)|>=1 if d(x,y)=2, where d(x,y) denotes the distance between x and y in G. The L(2,1)-...
Antimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1,...,m} to the edges such that the sums of incident labels are distinct at distinct vertices. Hartsfield and Ringel conjectured that every connected ...
The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs
Algorithms and Discrete Applied MathematicsAbstractA k-star colouring of a graph G is a function such that for every edge uv of G, and G does not contain a 4-vertex path bicoloured by f as a subgraph. For , the problem k-Star Colourability takes a graph G as input ...
Comments