CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines

Authors:
S. Gören;F. Ferguson
Affiliations:
Department of Computer Engineering, University of California, Santa Cruz;Department of Computer Engineering, University of California, Santa Cruz
Venue:
Proceedings of the conference on Design, automation and test in Europe
Year:
2002

Citing 0
Cited 2

Testing from Partial Deterministic FSM Specifications

IEEE Transactions on Computers
On state reduction of incompletely specified finite state machines

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A heuristic is proposed for state reduction in incompletelyspecified finite state machines (ISFSMs). The algorithm isbased on checking sequence generation and identificationof sets of compatible states. We have obtained results asgood as the best exact method in the literature but withsignificantly better run-times. In addition to finding areduced FSM, our algorithm also generates an I/Osequence that can be used as test vectors to verify theFSM麓s implementation.