On the use of don't cares during symbolic reachability analysis
Reda, S.; Wahba, Ayman; Salem, A.; Borrione, D.; Ghonaimy, M.;
Abstract
We present a new symbolic algorithm for reachability analysis in sequential circuits. Using don't cares from the computed reachable states, we introduce flexibility in choosing the transition relation, which can be used to minimize its Binary Decision Diagram (BDD). This can reduce the time-consuming image computation step. The technique is implemented and integrated in our equivalence checking system M-CHECK and its efficiency is shown on the ISCAS-89 benchmark circuits. © 2001 IEEE.
Other data
| Title | On the use of don't cares during symbolic reachability analysis | Authors | Reda, S.; Wahba, Ayman ; Salem, A.; Borrione, D.; Ghonaimy, M. | Issue Date | 1-Jan-2001 | Conference | ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings | ISBN | [0780366859, 9780780366855] | DOI | 10.1109/iscas.2001.922000 | Scopus ID | 2-s2.0-0035018470 |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.