Browse > Article

Approximate Reachability Analysis of Large Finite State Machines  

Hong, You-Pyo (동국대학교 전자공학과)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.27, no.1C, 2002 , pp. 78-83 More about this Journal
Abstract
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.
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. G. Govindaraju, D. L. Dill, J. P. Bergmann, Inproved Approximate Reachability using Auxilary State Variables, Proc. DAC, pp. 312- 316, 1999
2 R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Trans. Computers, vol. C-35, pp. 677-691, 1986   DOI   ScienceOn
3 A. Aziz, S. Tasiran, and R. Brayton, BDD Vaiiable Ordering for Interacting Finite State Machines, Proc. DAC, pp. 283-288, 1994
4 J. R. Burch, E. M. Clarke, D. Long, K. L. McMillan, and D. L. Dill, Sequential Circuit Verification Using Symbolic Model Checking, Proc. DAC, pp. 46-51, 1990
5 A. Narayan, A. J. Isles, J. Jain, R. K. Brayton, and A. Sangiovanni-Vincentelli, Reachability Analysis Using Partitioned-ROBDDs, Proc. ICCAD, pp. 388-393, 1997
6 S. G. Govindaraju, D. L. Dill, A. J. Hu, and M. A. Horowitz, Approximate Reachability with BDDs Using Overlapping Projections, Proc. DAC, pp. 451-456,1998
7 Y. Hong, P. A. Beerel, J. R. Burch, and K. L. McMillan, Safe BDD Minimization Using Don't Cares, Proc. DAC, pp.208-213, 1997
8 G. Cabodi, P. Camurati, and S. Quer, Improved Reachability Analysis of Large Finite State Machines, Proc. ICCAD, pp. 354 - 360, 1996
9 R. K. Ranjan, A. Aziz, R. K. Brayton, B. Plessier and C. Pixely, Efficient Formal Design Verification: Data Structure + Algorithms, Technical Report UCB/ERL M94, University of California, Berkeley, Oct., 1994
10 R. Rudell, Dynamic Variable Ordering for Ordered Binary Decision Diagrams, Proc. ICCAD, pp. 42-47, 1993
11 I. Moon, J. Kukula, T. Shiple, F. Somenzi, Least Fixpoint Approximations for Reachability Analysis, Proc. ICCAD, pp.41 - 44, 1999
12 K. Ravi and F. Somenzi, High-Density Reachability Analysis, Proc. ICCAD, pp. 154-158, 1995
13 O. Coudert, C. Berthet, and J. C. Madre, Verification of Synchronous Sequential Machines Based on Symbolic Execution, Automatic Verification Methods for Finite State systems, Springer-Verlag, pp.365-373, 1989
14 R. K. Brayton et. al., VIS: A System for Verification and Synthesis, Proc. Int'l Conference on CAV, pp. 428-432, July, 1996
15 H. Cho, G. D. Hachtel, E. Macii, B. Plessier, and F. Somenzi, Algorithms for Approximate FSM Traversal, Proc. DAC, pp. 25-30, 1993