Advertisement

On the influence of the state encoding on OBDD-representations of finite state machines

  • Christoph Meinel
  • Thorsten Theobald
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1295)

Abstract

Ordered binary decision diagrams are an important data structure for the representation of Boolean functions. Typically, the underlying variable ordering is used as an optimization parameter. When finite state machines are represented by OBDDs the state encoding can be used as an additional optimization parameter. In this paper, we analyze the influence of the state encoding on the OBDD-representations of counter-type finite state machines. In particular, we prove lower bounds, derive exact sizes for important encodings and construct a worst-case encoding which leads to exponential-size OBDDs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ATB94]
    A. Aziz, S. Taziran, and R. K. Brayton. BDD variable ordering for interacting finite state machines. In Proc. 31st ACMIIEEE Design Automation Conference, 283–288, 1994.Google Scholar
  2. [BCL+94]
    J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill. Symbolic model checking for sequential circuit verification. IEEE Transactions on CAD, 13:401–424, 1994.Google Scholar
  3. [BMS95]
    J. Bern, Ch. Meinel, and A. Slobodova. Global rebuilding of OBDDs-avoiding memory requirement maxima. In Proc. Computer-Aided Verification, Lecture Notes in Computer Science 939, 4-15. Springer, 1995.Google Scholar
  4. [Bry86]
    R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677–691, 1986.Google Scholar
  5. [Bry92]
    R. E. Bryant. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3):293–318, 1992.CrossRefGoogle Scholar
  6. [BW96]
    B. Bollig and I. Wegener. Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers, 45:993–1002, 1996.CrossRefGoogle Scholar
  7. [CBM89]
    O. Coudert, C. Berthet, and J. C. Madre. Verification of synchronous sequential machines using symbolic execution. In Proc. Workshop on Automatic Verification Methods for Finite State Machines, Lecture Notes in Computer Science 407, 365–373. Springer, 1989.Google Scholar
  8. [CM95]
    O. Coudert and J. C. Madre. The implicit set paradigm: A new approach to finite state system verification. Formal Methods in System Design, 6(2):133–145, 1995.CrossRefGoogle Scholar
  9. [GDN92]
    A. Ghosh, S. Devadas, and A. R. Newton. Sequential Logic Testing and Verification. Kluwer Academic Publishers, 1992.Google Scholar
  10. [MS94]
    Ch. Meinel and A. Slobodova. On the complexity of constructing optimal ordered binary decision diagrams. In Proc. Mathematical Foundations in Computer Science, Lecture Notes in Computer Science 841, 515–524, 1994.Google Scholar
  11. [MST97]
    Ch. Meinel, F. Somenzi, and T. Theobald. Linear sifting of decision diagrams. To appear at 34th ACM/IEEE Design Automation Conference (Anaheim, CA), 1997.Google Scholar
  12. [MT96]
    Ch. Meinel and T. Theobald. Local encoding transformations for optimizing OBDD-representations of finite state machines. In Proc. International Conference on Formal Methods in CAD (Palo Alto, CA), Lecture Notes in Computer Science 1166, 404–418. Springer, 1996.Google Scholar
  13. [Rud93]
    R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proc. IEEE International Conference on CAD, 42–47, 1993.Google Scholar
  14. [THY93]
    S. Tani, K. Hamaguchi, and S. Yajima.The complexity of the optimal variable ordering problems of shared binary decision diagrams. In Proc. International Symposium on Algorithms and Computation '93, Lecture Notes in Computer Science 762, 389–398. Springer, 1993.Google Scholar
  15. [Weg94]
    I. Wegener. Efficient data structures for Boolean functions. Discrete Mathematics, 136:347–372, 1994.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Christoph Meinel
    • 1
  • Thorsten Theobald
    • 1
  1. 1.FB IV — InformatikUniversität TrierTrierGermany

Personalised recommendations