Symbolic reachability analysis of large finite state machines using don't cares

Youpyo Hong, Peter A. Beerel
1999 Proceedings of the conference on Design, automation and test in Europe - DATE '99  
Reachability analysis of finite state machines is essential to many computer-aided design applications. We present new techniques to improve both approximate and exact reachability analysis using don't cares. First, we propose an iterative approximate reachability analysis technique in which don't care sets derived from previous iterations are used in subsequent iterations for better approximation. Second, we propose new techniques to use the final approximation to enhance the capability and
more » ... iciency of exact reachability analysis. Experimental results show that the new techniques can improve reachability analysis significantly.
doi:10.1145/307418.307430 fatcat:dcgmtex5qvelxnt4uerszh4qtm