loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design, Automation and Test in Europe (DATE '99)
Symbolic Reachability Analysis of Large Finite State Machines Using Don't Cares
Munich, Germany
March 09-March 12
ISBN: 0-7695-0078-1
Youpyo Hong, Synopsys, Inc
Peter A. Beerel, University of Southern California
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 efficiency of exact reachability analysis. Experimental results show that the new techniques can improve reachability analysis significantly.
Citation:
Youpyo Hong, Peter A. Beerel, "Symbolic Reachability Analysis of Large Finite State Machines Using Don't Cares," date, pp.13, Design, Automation and Test in Europe (DATE '99), 1999
Usage of this product signifies your acceptance of the Terms of Use.