The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Approximate Reachability Analysis of Large Finite State Machines

대규모 유한 상태 기계의 근사 도달성 분석

  • Published : 2002.01.01
Download PDF
⟨ Previous Next ⟩

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.

유한 상태 기계(finite state machine)의 도달성 분석(reachability analysis)은 통신 프로토콜이나 마이크로 프로세서 설계 등의 다양한 컴퓨터 원용설계응용(computer-aided design applications)에 매우 유용하다. 도달성 분석은 정확한 도달가능상태를 계산하는 정해분석(exact analysis)과 도달 불가능상태의 일부만을 계산하는 근사분석(approximate analysis)으로 나뉘는데, 본 논문은 기존의 방법보다 크게 정확도를 향상시킨 근사 도달분석 기법을 소개하며, 그 기본적인 원리는 근사분석 알고리즘을 반복 적용하되 이전 근사분석 결과를 이후의 근사분석에 활용하는 반복적 근사 도달성 분석 (iterative reachability analysis)을 통해 근사분석의 정확도를 향상시킬 수 있도록 하는 것이다. 반복적 근사 도달성 방식을 이용하여 기존의 근사분석보다 크게 향상된 근사도달상태를 계산할 수 있음을 실험적으로 증명하였다.

Keywords

References

  1. R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Trans. Computers, vol. C-35, pp. 677-691, 1986 https://doi.org/10.1109/TC.1986.1676819
  2. 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
  3. A. Aziz, S. Tasiran, and R. Brayton, BDD Vaiiable Ordering for Interacting Finite State Machines, Proc. DAC, pp. 283-288, 1994
  4. R. Rudell, Dynamic Variable Ordering for Ordered Binary Decision Diagrams, Proc. ICCAD, pp. 42-47, 1993
  5. K. Ravi and F. Somenzi, High-Density Reachability Analysis, Proc. ICCAD, pp. 154-158, 1995
  6. G. Cabodi, P. Camurati, and S. Quer, Improved Reachability Analysis of Large Finite State Machines, Proc. ICCAD, pp. 354 - 360, 1996
  7. 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
  8. R. K. Brayton et. al., VIS: A System for Verification and Synthesis, Proc. Int'l Conference on CAV, pp. 428-432, July, 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. 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
  11. 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
  12. H. Cho, G. D. Hachtel, E. Macii, B. Plessier, and F. Somenzi, Algorithms for Approximate FSM Traversal, Proc. DAC, pp. 25-30, 1993
  13. 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
  14. I. Moon, J. Kukula, T. Shiple, F. Somenzi, Least Fixpoint Approximations for Reachability Analysis, Proc. ICCAD, pp.41 - 44, 1999
  15. S. G. Govindaraju, D. L. Dill, J. P. Bergmann, Inproved Approximate Reachability using Auxilary State Variables, Proc. DAC, pp. 312- 316, 1999