Approximate Reachability Analysis of Large Finite State Machines
You-Pyo Hong · 2002
Reachability analysis of finite state machines is very useful for many computer-aided design applications such as communication protocol or microprecessor design. We present new techniques to improve approximate reachability analysis. The key idea is to used an iterative approximate reachability analysis technique in which don't care sets derived from previous iterations are used to improve the approximation in subsequent iterations. Experimental results show that the new techniques can improve reachability analysis significantly compared to existing analysis techniques.