Article

Free access

A fast state reduction algorithm for incompletely specified finite state machine

Authors:

Hiroyuki Higuchi,

Yusuke MatsunagaAuthors Info & Claims

DAC '96: Proceedings of the 33rd annual Design Automation Conference

Pages 463 - 466

https://doi.org/10.1145/240518.240606

Published: 01 June 1996 Publication History

PDF eReader

References

[1]

A. Grasselli and F. Luccio. "A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks". IRE Trans. on Elect. Comp., vol.14, pp.350-359, June 1965.

Crossref

Google Scholar

[2]

J.-K. Rho, G. Hachtel, F. Somenzi, and R. Jacoby. "Exact and Heuristic Algorithms for the Minimization of Incompletely Specified State Machines". IEEE Trans. on Computer-Aided Design, vol.13, pp.67-177, Feb. 1994.

Google Scholar

[3]

R. G. Bennetts, J. L. Washington, and D. W. Lewin. "A Computer Algorithm for State Table Reduction". Radio and Electronic Engineer, vol.42, pp.513-520, Nov. 1972.

Crossref

Google Scholar

[4]

M.A. Perkowski and N. Nguyen. "Minimization of Finite State Machine in System SuperPeg". in 28th Midwest Conf. on Circuits and Systems, pp. 139-147, Aug. 1985.

Google Scholar

[5]

L.N. Kannan and D. Sarma. "Fast Heuristic Algorithms for Finite State Machine Minimization". in Proc. of European Design Automation Conf., pp. 192-196, Feb. 1991.

Digital Library

Google Scholar

[6]

R. Btayton, G. Hachtel, C. McMullen, and A. Sangiovanni- Vincentelli. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, 1984.

Digital Library

Google Scholar

[7]

T. Kam, T. Villa, R. Brayton, and A.Sangiovanni-Vincentelli. "A Fully Implicit Algorithm for Exact State Minimization". in 31st ACM/IEEE Design Automation Conf., pages 684-690, June 1994.

Digital Library

Google Scholar

Cited By

View all

Cohen EVolentini EGruer P(2016)Modeling embedded applications: an orderly simplification of finite state automata description2016 Seventh Argentine Conference on Embedded Systems (CASE)10.1109/SASE-CASE.2016.7574100(39-43)Online publication date: Aug-2016
https://doi.org/10.1109/SASE-CASE.2016.7574100
Abel AReineke JMarculescu DLiu F(2015)MeMinProceedings of the IEEE/ACM International Conference on Computer-Aided Design10.5555/2840819.2840833(94-101)Online publication date: 2-Nov-2015
https://dl.acm.org/doi/10.5555/2840819.2840833
Abel AReineke J(2015)MEMIN: SAT-based exact minimization of incompletely specified Mealy machines2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)10.1109/ICCAD.2015.7372555(94-101)Online publication date: Nov-2015
https://doi.org/10.1109/ICCAD.2015.7372555
Show More Cited By

Index Terms

A fast state reduction algorithm for incompletely specified finite state machine
1. Hardware
  1. Integrated circuits
    1. Logic circuits
2. Theory of computation
  1. Logic
  2. Models of computation

Recommendations

On state reduction of incompletely specified finite state machines

State reduction of incompletely specified finite state machines (ISFSMs) is an important task in optimization of sequential circuit design and known as an NP-complete problem. Removal of redundant states reduces the logic, because of this, chip area ...
Experiments on Minimization Method of Incompletely Specified Finite State Machines for Low Power Design
Computer Information Systems and Industrial Management
Abstract
This paper presents a heuristic method for minimization of incompletely specified finite state machine with unspecified values of output variables. The proposed method is based on two states merging. In this method, such optimization criteria as ...
Minimization of incompletely specified mealy finite-state machines by merging two internal states

A heuristic method for the minimization of Mealy finite state machines (FSMs) with unspecified values of the output variables based on merging two states is considered. Necessary and sufficient conditions for the possibility to merge two states and for ...

Comments

Information & Contributors

Information

Published In

DAC '96: Proceedings of the 33rd annual Design Automation Conference

June 1996

839 pages

ISBN:0897917790

DOI:10.1145/240518

Chairmen:
Thomas P. Pennino
Bell Labs, Holmdel, NJ
,
Ellen J. Yoffa
IBM Corp., Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DAC96

Sponsor:

EDAC
SIGDA
IEEE-CAS

DAC96: The 33rd Design Automation Conference

June 3 - 7, 1996

Nevada, Las Vegas, USA

Acceptance Rates

DAC '96 Paper Acceptance Rate 142 of 377 submissions, 38%;

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
338
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)2

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cohen EVolentini EGruer P(2016)Modeling embedded applications: an orderly simplification of finite state automata description2016 Seventh Argentine Conference on Embedded Systems (CASE)10.1109/SASE-CASE.2016.7574100(39-43)Online publication date: Aug-2016
https://doi.org/10.1109/SASE-CASE.2016.7574100
Abel AReineke JMarculescu DLiu F(2015)MeMinProceedings of the IEEE/ACM International Conference on Computer-Aided Design10.5555/2840819.2840833(94-101)Online publication date: 2-Nov-2015
https://dl.acm.org/doi/10.5555/2840819.2840833
Abel AReineke J(2015)MEMIN: SAT-based exact minimization of incompletely specified Mealy machines2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)10.1109/ICCAD.2015.7372555(94-101)Online publication date: Nov-2015
https://doi.org/10.1109/ICCAD.2015.7372555
Alberto ASimao A(2013)Iterative minimization of partial finite state machinesOpen Computer Science10.2478/s13537-013-0106-03:2Online publication date: 1-Jan-2013
https://doi.org/10.2478/s13537-013-0106-0
Alberto ASimao A(2009)Minimization of incompletely specified finite state machines based on distinction graphs2009 10th Latin American Test Workshop10.1109/LATW.2009.4813796(1-6)Online publication date: Mar-2009
https://doi.org/10.1109/LATW.2009.4813796
Goren SFerguson F(2002)Chesmin: a heuristic for state reduction in incompletely specified finite state machinesProceedings 2002 Design, Automation and Test in Europe Conference and Exhibition10.1109/DATE.2002.998280(248-254)Online publication date: 2002
https://doi.org/10.1109/DATE.2002.998280
Hou JCerny E(2002)Model Reductions and a Case StudyFormal Methods in Computer-Aided Design10.1007/3-540-40922-X_19(336-352)Online publication date: 18-Jun-2002
https://doi.org/10.1007/3-540-40922-X_19
Pena JOliveira AYasuura H(1998)A new algorithm for the reduction of incompletely specified finite state machinesProceedings of the 1998 IEEE/ACM international conference on Computer-aided design10.1145/288548.289075(482-489)Online publication date: 1-Nov-1998
https://dl.acm.org/doi/10.1145/288548.289075

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On state reduction of incompletely specified finite state machines

Experiments on Minimization Method of Incompletely Specified Finite State Machines for Low Power Design

Minimization of incompletely specified mealy finite-state machines by merging two internal states

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

On state reduction of incompletely specified finite state machines

Experiments on Minimization Method of Incompletely Specified Finite State Machines for Low Power Design

Minimization of incompletely specified mealy finite-state machines by merging two internal states

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations