Theory and algorithms for state minimization of nondeterministic FSMs

Author

Kam, Timothy ; Villa, Tiziano ; Brayton, Robert K. ; Sangiovanni-Vincentelli, Alberto L.

Author_Institution

CAD Labs., Intel Corp., Hillsboro, OR, USA

Volume

16

Issue

11

fYear

1997

fDate

11/1/1997 12:00:00 AM

Firstpage

1311

Lastpage

1322

Abstract

This paper addresses state minimization problems of different classes of nondeterministic finite-state machines (NDFSMs). We describe a fully implicit algorithm for state minimization of pseudo nondeterministic FSM´s (PNDFSMs). The results of our implementation are reported and shown to be superior to a previous explicit formulation. We could solve exactly all but one problem of a published benchmark, while an explicit program could complete approximately one half of the examples, and in those cases, with longer run times. Then we present a theoretical solution to the problem of exact state minimization of general NDFSMs, based on the proposal of generalized compatibles. This gives an algorithmic framework to explore behaviors contained in a general NDFSM

Keywords

finite state machines; minimisation of switching nets; sequential switching; fully implicit algorithm; generalized compatibles; nondeterministic FSM; run times; state minimization problems; Cost function; Laboratories; Minimization methods; Network synthesis;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/43.663820

Filename

663820