BEAT-NP: A tool for partitioning Boolean networks

H. Cho, G. Hachtel, M. Nash, L. Setiono

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

BEAT_NP (BoolEAn Tools Network Partitioner) was designed to extend the application size capability of the BOLD (Boulder Optimal Logic Design) system. BEAT_NP partitions a Boolean network into subnetworks which satisfy user specified size constraints. Most of the tools in the BOLD tool suite solve problems which are in NP or Co-NP, so they can be assumed to have exponential complexity. Because the BEAT_NP algorithms have log-linear worst-case complexity, the CPU time requirements of optimization tools can be reduced greatly in difficult cases. When used with the BOLD minimizer on a set of well known benchmark examples, BEAT_NP reduced CPU time by 1 to 3 orders of magnitude while retaining a significant majority of the optimization savings available in the unpartitioned case.

Original languageEnglish
Title of host publicationIEEE Int Conf on Comput Aided Des ICCAD 88 a Conf for the EE CAD Prof
PublisherPubl by IEEE
Pages10-13
Number of pages4
ISBN (Print)0818608692
StatePublished - 1 Dec 1988
Externally publishedYes

Publication series

NameIEEE Int Conf on Comput Aided Des ICCAD 88 a Conf for the EE CAD Prof

Fingerprint

Dive into the research topics of 'BEAT-NP: A tool for partitioning Boolean networks'. Together they form a unique fingerprint.

Cite this