Simulation and SAT Based Boolean Matching for Large Boolean Networks
碩士 === 輔仁大學 === 資訊工程學系 === 96 === Given two functions with the same number of input variables, Boolean matching is to check if they are equivalent or not under input permutation and input/output phase assignment. This thesis will present a Boolean matching algorithm which only considers input permut...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/26807974821463965057 |