A new state reduction method of incompletely specified sequential machines is proposed in this paper. The method is based on a genetic algorithm implementing a dormant mechanism. MCNC benchmark machines are simplified by using this method to evaluate the method. The experimental results show that machines of almost the same number of states as the minimum ones can be derived by this method.
Masaki HASHIZUME
Teruyoshi MATSUSHIMA
Takashi SHIMAMOTO
Hiroyuki YOTSUYANAGI
Takeomi TAMESADA
Akio SAKAMOTO
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Masaki HASHIZUME, Teruyoshi MATSUSHIMA, Takashi SHIMAMOTO, Hiroyuki YOTSUYANAGI, Takeomi TAMESADA, Akio SAKAMOTO, "Genetic State Reduction Method of Incompletely Specified Machines" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 6, pp. 1555-1563, June 2004, doi: .
Abstract: A new state reduction method of incompletely specified sequential machines is proposed in this paper. The method is based on a genetic algorithm implementing a dormant mechanism. MCNC benchmark machines are simplified by using this method to evaluate the method. The experimental results show that machines of almost the same number of states as the minimum ones can be derived by this method.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_6_1555/_p
Copy
@ARTICLE{e87-a_6_1555,
author={Masaki HASHIZUME, Teruyoshi MATSUSHIMA, Takashi SHIMAMOTO, Hiroyuki YOTSUYANAGI, Takeomi TAMESADA, Akio SAKAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Genetic State Reduction Method of Incompletely Specified Machines},
year={2004},
volume={E87-A},
number={6},
pages={1555-1563},
abstract={A new state reduction method of incompletely specified sequential machines is proposed in this paper. The method is based on a genetic algorithm implementing a dormant mechanism. MCNC benchmark machines are simplified by using this method to evaluate the method. The experimental results show that machines of almost the same number of states as the minimum ones can be derived by this method.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Genetic State Reduction Method of Incompletely Specified Machines
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1555
EP - 1563
AU - Masaki HASHIZUME
AU - Teruyoshi MATSUSHIMA
AU - Takashi SHIMAMOTO
AU - Hiroyuki YOTSUYANAGI
AU - Takeomi TAMESADA
AU - Akio SAKAMOTO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2004
AB - A new state reduction method of incompletely specified sequential machines is proposed in this paper. The method is based on a genetic algorithm implementing a dormant mechanism. MCNC benchmark machines are simplified by using this method to evaluate the method. The experimental results show that machines of almost the same number of states as the minimum ones can be derived by this method.
ER -