Advertisement

Symbolic FSM Traversal Methods

  • Abhijit Ghosh
  • Srinivas Devadas
  • A. Richard Newton
Chapter
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 163)

Abstract

State Transition Graph traversal algorithms for finite state machines have applications in the area of synthesis, test, and verification. Traditional methods that enumerate the state space of the machine explicitly cannot handle machines with a large number of states. The approaches presented in the previous chapter try to combine implicit input enumeration with implicit state-space enumeration. Unfortunately, in general, states can only be combined if they are equivalent and have uni-distant state codes. Also, the method of enumeration involves a depth-first search of the STG.

Keywords

Boolean Function Clock Cycle Finite State Machine Reachable State Binary Decision Diagram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1992

Authors and Affiliations

  • Abhijit Ghosh
    • 1
  • Srinivas Devadas
    • 2
  • A. Richard Newton
    • 1
  1. 1.University of CaliforniaBerkeleyUSA
  2. 2.Massachusetts Institute of TechnologyUSA

Personalised recommendations