Skip to main content
Log in

HSM2: A new heuristic state minimization algorithm for finite state machine

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

This paper proposes a heuristic state minimization algorithm (HSM2) for finite state machines (FSM). HSM2 focuses on the generation and adjustment of the closed cover. First an initial closed cover is generated by heuristically selecting proper maximal compatibles to satisfy all the covering and closure conditions, and then it is adjusted to be a minimal or near minimal closed cover by heuristically removing repeated states. Experimental results show that the algorithm is faster and obtains better or the same solutions compared with conventional methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Liu Mingye. Computer Aided Logic Design Theory. Science Press, 1985. (in Chinese)

  2. Pager D. Conditions for existence of minimal closed covers composed of maximal compatibles.IRE Trans. Comp., 1971, 20: 450–452.

    MATH  Google Scholar 

  3. Higuchi H, Matsunaga Y. A fast state reduction algorithm for incompletely specified finite state machine. InProc. the 33rd Design Automation Conf., June 1996, Las Vegas, NV, USA, pp.463–466.

  4. Grasselli A, Luccio F. A method for minimization of the number of internal states in incompletely specified sequential networks.IRE Trans. Elect. Comp., June 1965, 14: 350–359.

    Article  MATH  Google Scholar 

  5. Rao C V S, Biswas N N. Minimization of incompletely specified sequential machines.IRE Trans. Computers, 1975, 24: 1089–1100.

    Article  MATH  MathSciNet  Google Scholar 

  6. Sanchez J M, Garnica A O, Lanchares J. A genetic algorithm for reducing the number of states in incompletely specified finite state machine.Micro Electronic Journal, 1995, 26(5): 463–470.

    Google Scholar 

  7. Kannan L N, Sarma D. Fast heuristic algorithm for finite state minimization.European Design Automation Conf., 1991, pp.192–196.

  8. Avedillo M J, Quintana J M, Huerias J L. New approach to the state reduction in incompletely specified sequential machine. InProc. IRE International Symposium on Circuits and Systems, 1990, pp.440–443.

  9. Imtiaz Ahmad, A Shoha Das. A heuristic algorithm for the minimization of incompletely specified finite state machine.Computers and Electrical Engineering, 2001, 27: 159–172.

    Article  MATH  Google Scholar 

  10. Gang Wang. The automatic synthesis of controller based on FSM theory [Thesis]. Tsinghua University, 1996.

  11. Rho J K, Hachtei G D, Somenzi F. Exact and heuristic algorithms for minimization of incompletely specified state machines.IRE Trans. Computer-Aided Design, 1994, 13: 167–177.

    Article  Google Scholar 

  12. Gupta B N V M. Narayanan H, Desai M P. A state assignment scheme targeting performance and area. InProc. 12th International Conference on VLSI Design, Jan. 1999, pp.378–383.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Note

Supported by the National Natural Science Foundation of China (Grant No.60236020) and the National Fundamental Research 973 Program of China (Grant No.G1998030403).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hu, H., Xue, HX. & Bian, JN. HSM2: A new heuristic state minimization algorithm for finite state machine. J. Comput. Sci. & Technol. 19, 729–733 (2004). https://doi.org/10.1007/BF02945600

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02945600

Keywords

Navigation