NDLI: Using simulation and satisfiability to compute flexibilities in Boolean networks

Content Provider	IEEE Xplore Digital Library
Author	Mishchenko, A. Zhang, J.S. Sinha, S. Burch, J.R. Brayton, R. Chrzanowska-Jeske, M.
Copyright Year	1982
Abstract	Simulation and Boolean satisfiability (SAT) checking are common techniques used in logic verification. This paper shows how simulation and satisfiability (S&S) can be tightly integrated to efficiently compute flexibilities in a multilevel Boolean network, including the following: 1) complete "don't cares" (CDCs); 2) sets of pairs of functions to be distinguished (SPFDs); and 3) sets of candidate nodes for resubstitution. These flexibilities can be used in network optimization to change the network structure while preserving its functionality. In the first two applications, simulation quickly enumerates most of the solutions while SAT detects the remaining solutions. In the last application, simulation efficiently filters out most of the infeasible solutions while SAT checks the remaining candidates. The experimental results confirm that the combination of simulation and SAT offers a computation engine that outperforms binary decision diagrams, which are traditionally used in such applications.
Sponsorship	IEEE Council on Electronic Design Automation IEEE Circuits and Systems Society
Starting Page	743
Ending Page	755
Page Count	13
File Size	411790
File Format	PDF
ISSN	02780070
Volume Number	25
Issue Number	5
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-05-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computational modeling Computer networks Intelligent networks Boolean functions Data structures Network synthesis Circuit simulation Filters Engines Logic simulation Boolean network logic synthesis satisfiability
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fast postplacement optimization using functional symmetries

Fault diagnosis and logic debugging using Boolean satisfiability

Testability of SPP Three-Level Logic Networks in Static Fault Models

Synthesis of SPP three-level logic networks using affine spaces

Efficient canonical form for Boolean matching of complex functions in large libraries

Robust Boolean reasoning for equivalence checking and functional property verification

Design error diagnosis and correction via test vector simulation

BDS: a BDD-based logic optimization system

Linear sifting of decision diagrams and its application in synthesis

Using simulation and satisfiability to compute flexibilities in Boolean networks

Similar Documents

Fast postplacement optimization using functional symmetries

Fault diagnosis and logic debugging using Boolean satisfiability

Testability of SPP Three-Level Logic Networks in Static Fault Models

Synthesis of SPP three-level logic networks using affine spaces

Efficient canonical form for Boolean matching of complex functions in large libraries

Robust Boolean reasoning for equivalence checking and functional property verification

Design error diagnosis and correction via test vector simulation

BDS: a BDD-based logic optimization system

Linear sifting of decision diagrams and its application in synthesis

Using simulation and satisfiability to compute flexibilities in Boolean networks