Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Reduced offsets for two-level multi-valued logic minimization
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
The use of observability and external don't cares for the simplification of multi-level networks
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
Don't cares in multi-level network optimization
Don't cares in multi-level network optimization
Logic optimization and code generation for embedded control applications
Proceedings of the ninth international symposium on Hardware/software codesign
FPGA '02 Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Don't cares and multi-valued logic network minimization
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Multi-Valued Functional Decomposition as a Machine Learning Method
ISMVL '98 Proceedings of the The 28th International Symposium on Multiple-Valued Logic
A new enhanced constructive decomposition and mapping algorithm
Proceedings of the 40th annual Design Automation Conference
Generalized cofactoring for logic function evaluation
Proceedings of the 40th annual Design Automation Conference
A robust algorithm for approximate compatible observability don't care (CODC) computation
Proceedings of the 41st annual Design Automation Conference
A Theory of Non-Deterministic Networks
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
SAT-Based Complete Don't-Care Computation for Network Optimization
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Functional test generation based on word-level SAT
Journal of Systems Architecture: the EUROMICRO Journal
Interpolating functions from large Boolean relations
Proceedings of the 2009 International Conference on Computer-Aided Design
An abstraction theory for qualitative models of biological systems
Theoretical Computer Science
Algebraic Representation of Asynchronous Multiple-Valued Networks and Its Dynamics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
We discuss the simplification of non-deterministic MV networks and their internal nodes using internal flexibilities. Given the network structure and its external specification, the flexibility at a node is derived as a non-deterministic MV relation. This flexibility is used to simplify the node representation and enhance the effect of Boolean resubstitution. We show that the flexibility derived is maximum. The proposed approach has been implemented and tested in MVSIS [16]. Experimental results show that it performs well on a variety of MV and binary benchmarks.