Approximate Reachability Analysis of Large Finite State Machines 


Vol. 27,  No. 1, pp. 78-83, Jan.  2002


PDF
  Abstract

Reachability analysis of finite state machines is very useful for many computer-aided design applications such as communication protocol or microprocessor design. We present new techniques to improve approximate reachability analysis. The key idea is to use 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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. Hong, "Approximate Reachability Analysis of Large Finite State Machines," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 1, pp. 78-83, 2002. DOI: .

[ACM Style]

Youpyo Hong. 2002. Approximate Reachability Analysis of Large Finite State Machines. The Journal of Korean Institute of Communications and Information Sciences, 27, 1, (2002), 78-83. DOI: .

[KICS Style]

Youpyo Hong, "Approximate Reachability Analysis of Large Finite State Machines," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 1, pp. 78-83, 1. 2002.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880