An Efficient Method for Generating Optimal OBDD of Boolean Functions
An efficient method of finding optimal (OBDD) of an n variable Boolean function is presented that offers a simple and straightforward procedure for optimal OBDD generation along with storage economy. This is achieved by generating n! fold tables and applying node reduction rules to each fold table d...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
Canadian Center of Science and Education
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/47374 |
| _version_ | 1848757815398629376 |
|---|---|
| author | Singh, Ashutosh Mohan, Anand |
| author_facet | Singh, Ashutosh Mohan, Anand |
| author_sort | Singh, Ashutosh |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | An efficient method of finding optimal (OBDD) of an n variable Boolean function is presented that offers a simple and straightforward procedure for optimal OBDD generation along with storage economy. This is achieved by generating n! fold tables and applying node reduction rules to each fold table directly instead of generating all n! OBDDs of the function. |
| first_indexed | 2025-11-14T09:34:05Z |
| format | Journal Article |
| id | curtin-20.500.11937-47374 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:34:05Z |
| publishDate | 2008 |
| publisher | Canadian Center of Science and Education |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-473742017-01-30T15:32:55Z An Efficient Method for Generating Optimal OBDD of Boolean Functions Singh, Ashutosh Mohan, Anand Binary Decision Diagrams Formal Verification Fold Table An efficient method of finding optimal (OBDD) of an n variable Boolean function is presented that offers a simple and straightforward procedure for optimal OBDD generation along with storage economy. This is achieved by generating n! fold tables and applying node reduction rules to each fold table directly instead of generating all n! OBDDs of the function. 2008 Journal Article http://hdl.handle.net/20.500.11937/47374 Canadian Center of Science and Education fulltext |
| spellingShingle | Binary Decision Diagrams Formal Verification Fold Table Singh, Ashutosh Mohan, Anand An Efficient Method for Generating Optimal OBDD of Boolean Functions |
| title | An Efficient Method for Generating Optimal OBDD of Boolean Functions |
| title_full | An Efficient Method for Generating Optimal OBDD of Boolean Functions |
| title_fullStr | An Efficient Method for Generating Optimal OBDD of Boolean Functions |
| title_full_unstemmed | An Efficient Method for Generating Optimal OBDD of Boolean Functions |
| title_short | An Efficient Method for Generating Optimal OBDD of Boolean Functions |
| title_sort | efficient method for generating optimal obdd of boolean functions |
| topic | Binary Decision Diagrams Formal Verification Fold Table |
| url | http://hdl.handle.net/20.500.11937/47374 |