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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1295, Issue , 1997, Pages 408-417

  Meinel, Christoph ^a   Theobald, Thorsten ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; ENCODING (SYMBOLS); STATE ASSIGNMENT;

ENCODINGS; LOWER BOUNDS; OPTIMIZATION PARAMETER; ORDERED BINARY DECISION DIAGRAMS; STATE ENCODING; VARIABLE ORDER;

SIGNAL ENCODING;

EID: 84884690040     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0029984     Document Type: Conference Paper

References (15)

1. A. Aziz, S. Taziran, and R. K. Brayton. BDD variable ordering for interacting finite state machines. In Proc. 31st ACM/IEEE Design Automation Conference, 283-288, 1994.
2. 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.
3. J. Bern, Ch. Meinel, and A. Slobodová Global rebuilding of OBDDs-avoiding memory requirement maxima. In Proc. Computer-Aided Verification, Lecture Notes in Computer Science 939, 4-15. Springer, 1995.
4. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677-691, 1986.
5. R. E. Bryant. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
6. B. Bollig and I. Wegener. Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers, 45:993-1002, 1996.
7. O. Coudert, C. Berthet, and J. C. Madre. Verification of synchronous sequential machines using symbolic execution. In Proc. Workshop on Automatic Verification Methods]or Finite State Machines, Lecture Notes in Computer Science 407, 365-373. Springer, 1989.
8. 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.
9. A. Ghosh, S. Devadas, and A. R. Newton. Sequential Logic Testing and Verification. Kluwer Academic Publishers, 1992.
10. Ch. Meinel and A. Slobodov£ 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.
11. Ch. Meinel, F. Somenzi, and T Theobald. Linear sifting of decision diagrams. To appear at 34th ACM/IEEE Design Automation Conference (Anaheim, CA), 1997.
12. 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.
13. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proe. IEEE International Conference on CAD, 42-47, 1993.
14. 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.
15. I. Wegener. Efficient data structures for Boolean functions. Discrete Mathematics, 136:347-372, 1994.