Symbolic reachability analysis of large finite state machines using don't cares

Youpyo Hong; Peter A. Beerel

doi:10.1109/DATE.1999.761091

Symbolic reachability analysis of large finite state machines using don't cares

Youpyo Hong
, Peter A. Beerel

Department of Electronics & Electrical Engineering

University of Southern California

Research output: Contribution to journal › Conference article › peer-review

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 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.

Original language	English
Article number	761091
Pages (from-to)	13-19
Number of pages	7
Journal	Proceedings -Design, Automation and Test in Europe, DATE
DOIs	https://doi.org/10.1109/DATE.1999.761091
State	Published - 1999
Event	Design, Automation and Test in Europe Conference and Exhibition 1999, DATE 1999 - Munich, Germany Duration: 9 Mar 1999 → 12 Mar 1999

Access to Document

10.1109/DATE.1999.761091

Cite this

@article{20c1d239d46a49f0929e0ea0a5951696,

title = "Symbolic reachability analysis of large finite state machines using don't cares",

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 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.",

author = "Youpyo Hong and Beerel, \{Peter A.\}",

year = "1999",

doi = "10.1109/DATE.1999.761091",

language = "English",

pages = "13--19",

journal = "Proceedings -Design, Automation and Test in Europe, DATE",

issn = "1530-1591",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Design, Automation and Test in Europe Conference and Exhibition 1999, DATE 1999 ; Conference date: 09-03-1999 Through 12-03-1999",

}

TY - JOUR

T1 - Symbolic reachability analysis of large finite state machines using don't cares

AU - Hong, Youpyo

AU - Beerel, Peter A.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84893562569

U2 - 10.1109/DATE.1999.761091

DO - 10.1109/DATE.1999.761091

M3 - Conference article

AN - SCOPUS:84893562569

SN - 1530-1591

SP - 13

EP - 19

JO - Proceedings -Design, Automation and Test in Europe, DATE

JF - Proceedings -Design, Automation and Test in Europe, DATE

M1 - 761091

T2 - Design, Automation and Test in Europe Conference and Exhibition 1999, DATE 1999

Y2 - 9 March 1999 through 12 March 1999

ER -

Symbolic reachability analysis of large finite state machines using don't cares

Abstract

Access to Document

Other files and links

Fingerprint

Cite this