loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2002 Design, Automation and Test in Europe Conference and Exhibition (DATE'02)
CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines
Paris, France
March 04-March 08
ISBN: 0-7695-1471-5
A heuristic is proposed for state reduction in incompletely specified finite state machines (ISFSMs). The algorithm is based on checking sequence generation and identification of sets of compatible states. We have obtained results as good as the best exact method in the literature but with significantly better run-times. In addition to finding a reduced FSM, our algorithm also generates an I/O sequence that can be used as test vectors to verify the FSM?s implementation.
Citation:
S. Gören, F. Ferguson, "CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines," date, pp.0248, 2002 Design, Automation and Test in Europe Conference and Exhibition (DATE'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.