IEICE TRANSACTIONS on Fundamentals
Heuristic State Reduction Methods of Incompletely Specified Machines Preceding to Satisfy Covering Condition
Summary :
This paper presents two kinds of simplification methods for incompletely specified sequential machines. The strategy of the methods is that as many states in original machines are covered in the simplification processes as possible. The purpose of the methods is to derive a simplified machine having either the largest maximal compatible set or its subset. With the methods, one of the minimal machines can not be always derived, but a near-minimal machine can be obtained more quickly with less memory, since they need not derive all the compatible sets. In this paper, the effectiveness of the methods is checked by applying them to simplification problems of incompletely specified machines generated by using random numbers, and of the MCNC benchmark machines. The experimental results show that our methods can derive a simplified machine quickly, especially for machines having a great number of states or don't care rate.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.6 pp.1045-1054
- Publication Date
- 1998/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section of Papers Selected from ITC-CSCC'97)
- Category
- VLSI Design Technology and CAD
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Masaki HASHIZUME, Takeomi TAMESADA, Takashi SHIMAMOTO, Akio SAKAMOTO, "Heuristic State Reduction Methods of Incompletely Specified Machines Preceding to Satisfy Covering Condition" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 6, pp. 1045-1054, June 1998, doi: .
Abstract: This paper presents two kinds of simplification methods for incompletely specified sequential machines. The strategy of the methods is that as many states in original machines are covered in the simplification processes as possible. The purpose of the methods is to derive a simplified machine having either the largest maximal compatible set or its subset. With the methods, one of the minimal machines can not be always derived, but a near-minimal machine can be obtained more quickly with less memory, since they need not derive all the compatible sets. In this paper, the effectiveness of the methods is checked by applying them to simplification problems of incompletely specified machines generated by using random numbers, and of the MCNC benchmark machines. The experimental results show that our methods can derive a simplified machine quickly, especially for machines having a great number of states or don't care rate.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_6_1045/_p
Copy
@ARTICLE{e81-a_6_1045,
author={Masaki HASHIZUME, Takeomi TAMESADA, Takashi SHIMAMOTO, Akio SAKAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Heuristic State Reduction Methods of Incompletely Specified Machines Preceding to Satisfy Covering Condition},
year={1998},
volume={E81-A},
number={6},
pages={1045-1054},
abstract={This paper presents two kinds of simplification methods for incompletely specified sequential machines. The strategy of the methods is that as many states in original machines are covered in the simplification processes as possible. The purpose of the methods is to derive a simplified machine having either the largest maximal compatible set or its subset. With the methods, one of the minimal machines can not be always derived, but a near-minimal machine can be obtained more quickly with less memory, since they need not derive all the compatible sets. In this paper, the effectiveness of the methods is checked by applying them to simplification problems of incompletely specified machines generated by using random numbers, and of the MCNC benchmark machines. The experimental results show that our methods can derive a simplified machine quickly, especially for machines having a great number of states or don't care rate.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Heuristic State Reduction Methods of Incompletely Specified Machines Preceding to Satisfy Covering Condition
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1045
EP - 1054
AU - Masaki HASHIZUME
AU - Takeomi TAMESADA
AU - Takashi SHIMAMOTO
AU - Akio SAKAMOTO
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1998
AB - This paper presents two kinds of simplification methods for incompletely specified sequential machines. The strategy of the methods is that as many states in original machines are covered in the simplification processes as possible. The purpose of the methods is to derive a simplified machine having either the largest maximal compatible set or its subset. With the methods, one of the minimal machines can not be always derived, but a near-minimal machine can be obtained more quickly with less memory, since they need not derive all the compatible sets. In this paper, the effectiveness of the methods is checked by applying them to simplification problems of incompletely specified machines generated by using random numbers, and of the MCNC benchmark machines. The experimental results show that our methods can derive a simplified machine quickly, especially for machines having a great number of states or don't care rate.
ER -
English
