Skip to main content
SpringerLink
Log in

Factored Edge-Valued Binary Decision Diagrams

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

Factored Edge-Valued Binary Decision Diagrams form an extension to Edge-Valued Binary Decision Diagrams. By associating both an additive and a multiplicative weight with the edges, FEVBDDs can be used to represent a wider range of functions concisely. As a result, the computational complexity for certain operations can be significantly reduced compared to EVBDDs. Additionally, the introduction of multiplicative edge weights allows us to directly represent the so-called complement edges which are used in OBDDs, thus providing a one to one mapping of all OBDDs to FEVBDDs. Applications such as integer linear programming and logic verification that have been proposed for EVBDDs also benefit from the extension. We also present a complete matrix package based on FEVBDDs and apply the package to the problem of solving the Chapman-Kolmogorov equations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S.B. Akers, "Binary decision diagrams," IEEE Transactions on Computers, Vol. C-27, pp. 509-516, June 1978.

    Google Scholar 

  2. R.I. Bahar, E.A. Fromm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Pardo, and F. Somenzi, "Algebraic decision diagrams and their applications," International Conference on Computer-Aided Design, pp. 188-191, Nov. 1993.

  3. B. Becker, R. Drechsler, and R. Werchner, "On the relation between BDDs and FDDs," Technical Report 12/93, University of Frankfurt, 1993.

  4. K.S. Brace, R.L. Rudell, and R.E. Bryant, "Efficient implementation of a BDD package," 27th Design Automation Conference, pp. 40-45, 1990.

  5. R.E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Transactions on Computers, Vol. C-35, No. 8, pp. 677-691, Aug. 1986.

    Google Scholar 

  6. R.E. Bryant, "Symbolic Boolean manipulation with ordered binary-decision diagrams," ACM Computing Surveys, Vol. 24, No. 3, pp. 293-318, Sept. 1992.

    Google Scholar 

  7. R.E. Bryant and Y.-A. Chen, "Verification of arithmetic functions with binary moment diagrams," CMU-CS-94-160, May 1994.

  8. E. Clarke, K.L. McMillan, X. Zhao, M. Fujita, and J.C.-Y. Yang, "Spectral transforms for large Boolean functions with application to technology mapping," 30th ACM/IEEE Design Automation Conference, Dallas, TX, June 1993, pp. 54-60.

  9. E. Clarke, M. Fujita, P.C. McGeer, K.L. McMillan, and J.C.-Y. Yang, "Multi-terminal binary decision diagrams: An efficient data structure for matrix representation," unpublished, 1993.

  10. R. Drechsler, A. Sarabi, M. Theobald, B. Becker, and M.A. Perkowski, "Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams".

  11. D.F. Elliott and K.R. Rao, Fast Transforms. Algorithms, Analyses, Applications, Academic Press, 1982.

  12. D.E. Knuth, The Art of Computer Programming: Seminumerical Algorithms, 2nd edition, Vol. 2, Addison Wesley, 1981.

  13. Y.-T. Lai and S. Sastry, "Edge-valued binary decision diagrams for multi-level hierarchical verification," 29th Design Automation Conference, pp. 608-613, June 1992.

  14. Y.-T. Lai, M. Pedram, and S.B.K. Vrudhula, "Edge-valued binary decision diagrams," IEEE Trans. on Computers, Vol. 45, No. 2, pp. 247-255, 1996.

    Google Scholar 

  15. Y.-T. Lai, M. Pedram, and S.B.K. Vrudhula, "FGILP: An integer linear program solver based on function graphs," International Conference on Computer-Aided Design, pp. 685-689, Nov. 1993.

  16. Y.-T. Lai, M. Pedram, and S.B.K. Vrudhula, "EVBDD-based algorithms for integer linear programming, spectral transformation and function decomposition," IEEE Trans. on Computer-Aided Design, Vol. 13, No. 8, pp. 959-975, 1994.

    Google Scholar 

  17. c.y. lee, "Representation of switching circuits by binary-decision-programs," Bell. syst. tech. j., vol. 38, pp. 985-999, july 195

    Google Scholar 

  18. S. Ross, A First Course in Probability, Macmillan, 1988.

  19. J. Stoer and R. Bulirsch, Introduction to Numerical Analysis, Springer-Verlag, 1980.

  20. P. Tafertshofer and M. Pedram, "Factored edge-valued binary decision diagrams and their application to matrix representation and manipulation," Technical Report CENG 94-27, Department of Electrical Engineering-Systems, University of Southern California, Oct. 1994.

Download references

Author information

Authors and Affiliations

  1. Institute of Electronic Design Automation, Technical University of Munich, Munich, Germany

    Paul Tafertshofer

  2. Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA, 90089

    Massoud Pedram

Authors
  1. Paul Tafertshofer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Massoud Pedram
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tafertshofer, P., Pedram, M. Factored Edge-Valued Binary Decision Diagrams. Formal Methods in System Design 10, 243–270 (1997). https://doi.org/10.1023/A:1008691605584

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008691605584

Search

Navigation