Symbolic Reachability Analysis of Large Finite State Machines Using Don’t Cares

  • Youpyo Hong Synopsys
  • Published 1999

Abstract

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… (More)

Topics

5 Figures and Tables

Cite this paper

@inproceedings{Synopsys1999SymbolicRA, title={Symbolic Reachability Analysis of Large Finite State Machines Using Don’t Cares}, author={Youpyo Hong Synopsys}, year={1999} }