Abstract
BDD-based symbolic traversals are the state-of-the-art technique for reachability analysis of finite state machines. They are currently limited to medium-small circuits for two reasons: BDD peak size during image computation and BDD explosion for state space representation. Starting from these limits, this paper presents a technique that decomposes the search space decreasing the BDD peak size and the number of page faults during image computation. Results of intermediate computations and large BDDs are efficiently stored in the secondary memory. A decomposed traversal that allows exact explorations of state spaces is obtained. Experimental results show that this approach is particularly effective on the larger MCNC, ISCAS'89, and ISCAS'89-addendum circuits.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
