By Topic

Algorithms for Approximate FSM Traversal

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Hyunwoo Cho ; Department of Electrical and Computer Engineering, University of Colorado at Boulder ; Hachtel, G.D. ; Macii, E. ; Plessier, B.
more authors

In this paper we present algorithms for approximate FSM traversal based on state space decomposition. The original FSM is partitioned in sub-machines, and each of them is traversed separately; the result is an over-estimation of the set of reachable states. Several traversal strategies are discussed. Good partitioning is important for the performance of the traversal techniques; a method to heuristically find an appropriate decomposition, based on the exploration of the FSM latch connection graph, is proposed. Applications of the approximate traversal methods to sequential optimization and behavioral verification of FSM's are described; experimental results for such applications, together with data concerning pure traversal, are reported.

Published in:

Design Automation, 1993. 30th Conference on

Date of Conference:

14-18 June 1993