Chesmin: a heuristic for state reduction in incompletely specified finite state machines

Author

Gören, Sezer ; Ferguson, F. Joel

Author_Institution

Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA

fYear

2002

fDate

2002

Firstpage

248

Lastpage

254

Abstract

A heuristic algorithm, chesmin (checking sequence based state minimization), 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

Keywords

finite state machines; logic design; logic testing; minimisation of switching nets; state assignment; FSM implementation; I/O sequence generation; checking sequence based state minimization; checking sequence generation; chesmin heuristic algorithm; compatible states identification; identification; incompletely specified finite state machines; reduced FSM; run-times; state reduction; test vectors; Algorithm design and analysis; Automata; Automatic testing; Design automation; Design engineering; Equations; Europe;

fLanguage

English

Publisher

ieee

Conference_Titel

Design, Automation and Test in Europe Conference and Exhibition, 2002. Proceedings

Conference_Location

Paris

ISSN

1530-1591

Print_ISBN

0-7695-1471-5

Type

conf

DOI

10.1109/DATE.2002.998280

Filename

998280