BDD-based symbolic traversals are the state-of-the-art technaque for reachability analysis of Finite State Machines. They are currently limited to medium-small circuits for two reasons: peak BDD size during image computation and BDD explosion for representing state sets. Startang from these limits, this paper presents an optimized traversal technique particularly orzented to the exact exploration of the state space of large machines.This i s possible thanks to: 1 ) temporary simplification of a Fanite State Machine b y removing some of its state elements, 2) a "divide-and-conquer" approach based on state set decomposition. An eflective use of secondary memory allows us to store relevant portions of BDDs and to regularize access to memory, resulting in less page faults. Experimental results show that this approach is particularly eflective on the larger ISCAS'89 and ISCAS'89-addendum'93 circuits.

No abstract

No abstract

No abstract

No abstract