An Efficient Method for Generating Optimal OBDD of Boolean Functions
| dc.contributor.author | Singh, Ashutosh | |
| dc.contributor.author | Mohan, Anand | |
| dc.date.accessioned | 2017-01-30T15:32:55Z | |
| dc.date.available | 2017-01-30T15:32:55Z | |
| dc.date.created | 2009-05-14T02:17:10Z | |
| dc.date.issued | 2008 | |
| dc.identifier.citation | Singh, Ashutosh Kumar and Mohan, Anand. 2008. An Efficient Method for Generating Optimal OBDD of Boolean Functions. Computer and Information Science. 1 (2): pp. 56-62. | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/47374 | |
| dc.description.abstract |
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. | |
| dc.publisher | Canadian Center of Science and Education | |
| dc.subject | Binary Decision Diagrams | |
| dc.subject | Formal Verification | |
| dc.subject | Fold Table | |
| dc.title | An Efficient Method for Generating Optimal OBDD of Boolean Functions | |
| dc.type | Journal Article | |
| dcterms.source.volume | 1 | |
| dcterms.source.number | 2 | |
| dcterms.source.startPage | 56 | |
| dcterms.source.endPage | 62 | |
| dcterms.source.issn | 1913-8989 | |
| dcterms.source.title | Computer and Information Science | |
| curtin.department | Curtin Sarawak - Faculty Office | |
| curtin.accessStatus | Open access |