Skip to main content
Springer Nature Link
Log in

Local encoding transformations for optimizing OBDD-representations of finite state machines

  • Conference paper
  • First Online:
Formal Methods in Computer-Aided Design (FMCAD 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1166))

Included in the following conference series:

  • 138 Accesses

Abstract

Ordered binary decision diagrams are the state-of-the-art representation of switching functions. In order to keep the sizes of the OBDDs tractable, heuristics and dynamic reordering algorithms are applied to optimize the underlying variable order. When finite state machines are represented by OBDDs the state encoding can be used as an additional optimization parameter. In this paper, we analyze local encoding transformations which can be applied dynamically. First, we investigate the potential of re-encoding techniques. We then propose the use of an XOR-transformation and show why this transformation is most suitable among the set of all encoding transformations. Preliminary experimental results illustrate that the proposed method in fact yields a reduction of the OBDD-sizes.

Supported by DFG-Graduiertenkolleg “Mathematische Optimierung”.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aziz, S. Taziran, and R. K. Brayton. BDD variable ordering for interacting finite state machines. In 31st ACM/IEEE Design Automation Conference, pp. 283–288, 1994.

    Google Scholar 

  2. B. Bollig, M. Löbbing, and I. Wegener. Simulated annealing to improve variable orderings for OBDDs. In International Workshop on Logic Synthesis, 1995.

    Google Scholar 

  3. J. Bern, Ch. Meinel, and A. Slobodová. OBDD-based Boolean manipulation in CAD beyond current limits. In 32nd ACM/IEEE Design Automation Conference, 1995.

    Google Scholar 

  4. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677–691, 1986.

    Google Scholar 

  5. M. Fujita, Y. Kukimoto, and R. K. Brayton. BDD minimization by truth table permutations. In International Workshop on Logic Synthesis, 1995.

    Google Scholar 

  6. A. Ghosh, S. Devadas, and A. R. Newton. Sequential Logic Testing and Verification. Kluwer Academic Publishers, 1992.

    Google Scholar 

  7. U. Kebschull, E. Schubert, and W. Rosenstiel. Multilevel logic synthesis based on functional decision diagrams. In European Design Automation Conference, pp. 43–47, 1992.

    Google Scholar 

  8. H.-T. Liaw and C.-S. Lin. On the OBDD-representation of general Boolean functions. IEEE Transactions on Computers, 41:661–664, 1992.

    Google Scholar 

  9. Ch. Meinel and T. Theobald. Local encoding transformations for optimizing OBDD-representations of finite state machines. Technical Report 96-23, Universität Trier, 1996.

    Google Scholar 

  10. S. Malik, A. Wang, R. K. Brayton, and A. Sangiovanni-Vincentelli. Logic verification using binary decision diagrams in a logic synthesis environment. In IEEE International Conference on Computer-Aided Design, pp. 6–9, 1988.

    Google Scholar 

  11. S. Panda and F. Somenzi. Who are the variables in your neighborhood. In IEEE International Conference on Computer-Aided Design, 1995.

    Google Scholar 

  12. S. Quer, G. Cabodi, P. Camurati, L. Lavagno, E. M. Sentovich, and R. K. Brayton. Incremental FSM re-encoding for simplifying verification by symbolic traversal. In International Workshop on Logic Synthesis, 1995.

    Google Scholar 

  13. K. Ravi and F. Somenzi. High-density reachability analysis. In IEEE International Conference on Computer-Aided Design, 1995.

    Google Scholar 

  14. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In IEEE International Conference on Computer-Aided Design, pp. 42–47, 1993.

    Google Scholar 

  15. C. E. Shannon. The synthesis of two-terminal switching circuits. Bell System Technical Journal, 28:59–98, 1949.

    Google Scholar 

  16. D. Sieling and I. Wegener. NC-algorithms for operations on binary decision diagrams. Parallel Processing Letters, 3:3–12, 1993.

    Google Scholar 

  17. T. Theobald and Ch. Meinel. State encodings and OBDD-sizes. Technical Report 96-04, Universität Trier, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB IV - Informatik, Universität Trier, D-54286, Trier, Germany

    Christoph Meinel & Thorsten Theobald

Authors
  1. Christoph Meinel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thorsten Theobald
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mandayam Srivas Albert Camilleri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meinel, C., Theobald, T. (1996). Local encoding transformations for optimizing OBDD-representations of finite state machines. In: Srivas, M., Camilleri, A. (eds) Formal Methods in Computer-Aided Design. FMCAD 1996. Lecture Notes in Computer Science, vol 1166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031824

Download citation

  • DOI: https://doi.org/10.1007/BFb0031824

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61937-6

  • Online ISBN: 978-3-540-49567-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics