Heuristic algorithm for the minimization of incompletely specified finite state machines

Computers and Electrical Engineering

Volumn 27, Issue 2, 2001, Pages 159-172

  Ahmad, Imtiaz ^a   Das, A Shoba ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; HEURISTIC METHODS; SEQUENTIAL MACHINES;

FINITE STATE MACHINES (FSM);

SEQUENTIAL CIRCUITS;

EID: 0035342740     PISSN: 00457906     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0045-7906(00)00016-1     Document Type: Article

References (22)

1. Grasselli A, Luccio F. A method for minimizing the number of internal states in incompletely specified sequential networks. IEEE Transactions on Electronic Computers, June 1965:350-59.
2. Reusch B., Merzenich W. Minimal coverings for incompletely specified sequential machines. Acta Informatica. 22:1986;663-678.
3. Pfleeger C.P. State reduction in incompletely specified finite state machines. IEEE Transactions on Computers. 22:1973;1099-1102.
4. Rao C.V.S., Biswas N.N. Minimization of incompletely specified sequential machines. IEEE Transactions on Computers. 24:1975;1089-1100.
5. Pager D. Conditions for existence of minimal closed covers composed of maximal compatibles. IEEE Transactions on Computers. 20:1971;450-452.
6. Hachtel G.D., Somenzi F. Logic synthesis and verification algorithms. 1996;Kluwer Academic Publishers, Dordrecht.
7. Higuchi H., Matsunaga Y. A fast state reduction algorithm for incompletely specified finite state machines. ACM/IEEE 33rd Design Automation Conference :1996.
8. Rho J.K., Somenzi F. The role of prime compatibles in the minimization of finite state machines. IEEE International Conference on Computer-Design (ICCD-92) :1992;324-327.
9. Rho J.K., Hachtel G.D., Somenzi F. Exact and heuristic algorithms for minimization of incompletely specified state machines. IEEE Transactions on Computer-Aided Design. 13:1994;167-177.
10. Sanchez J.M., Garnica A.O., Lanchares J. A genetic algorithm for reducing the number of states in incompletely specified finite state machines. Micro Electronic Journal. 26:(5):1995;463-470.
11. Kannan L.N., Sarma D. Fast heuristic algorithm for finite state minimization. European Design Automation Conference (EDAC-91) :1991;192-196.
12. Perkowski M.A., Nguyen N. Minimization of finite state machine in system superpeg. 28th Midwest Symposium on Circuits and Systems :1985;139-147.
13. Paul M.C., Unger S.H. Minimizing the number of states in incompletely specified sequential switching functions. IRE Transactions on Electronic Computers. 8:1959;356-367.
14. Avedillo M.J., Quintana J.M., Huertas J.L. New approach to the state reduction in incompletely specified sequential machines. IEEE International Symposium on Circuits and Systems :1990;440-443.
15. Gupta P.K., Dietmeyer D.L. Fast state minimization of incompletely specified sequential machines. IEEE Transactions on Computers. 22:1973;215-217.
16. Bennetts R.G. An improved method of prime C-class derivation in the state reduction of sequential networks. IEEE Transactions on Computers. 20:1971;229-231.
17. Fuhrer R.M., Norwick S.M. OPTIMIST: state minimization for optimal 2-level logic implementation. IEEE International Conference on Computer-Aided Design (ICCAD-97) :1997;308-315.
18. Puri R., Gu J. An Efficient Algorithm to Search for Minimal Closed Covers in Sequential Machines. IEEE Transactions on Computer-Aided Design. 12:1993;737-745.
19. DeSarkar S.C., Basu A.K., Choudhury A.K. Simplification of incompletely specified flow tables with the help of prime closed sets. IEEE Transactions on Computers. 18:1969;953-956.
20. Yang S. Logic synthesis and optimization benchmarks user guide. Version 3.0, MCNC, 1991.
21. Kam T., Villa T., Brayton R.K., Sangiovanni-Vincentelli A. A fully implicit algorithm for exact state minimization. 31st ACM/IEEE Design Automation Conference :1994;684-690.
22. Kohavi Z. Switching and finite automata theory. 1978;Mc-Graw Hill, New York.