IEICE TRANSACTIONS on transactions
Sequential Machines Having Quasi-Stable States and Their State Reduction
Summary :
Asynchronous sequential circuits, obtained by generalizing the astable multivibrator and monostable one as sequential circuits having state-transitions among any number of stable states and quasi-stable states, are called sequential circuits having quasistable states (SCQ's). Moreover, a mathematical model of the SCQ is called the sequential machine having quasi-stable states (SMQ). This paper is devoted mainly to the state reduction problem of the SMQ. There are two types of the SMQ's (celled type I and type II). The difference between the types is the specifications of each quasi-stable duration. Thus this paper describes state reduction methods for type I and type II, where the latter utilizes the former. The systematic state reduction methods described in this paper become considerably more complicated than that for conventional sequential machines, because of the particularity of the quasistable state. Of course, this method is an extension of the state reduction method for the conventional asynchronous sequential machine. This paper includes a definition and representations of the SMQ, definitions of concepts available for the SMQ's, and their systematic state reduction methods.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E64-E No.3 pp.147-154
- Publication Date
- 1981/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Digital Circuits
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
Takeomi TAMESADA, "Sequential Machines Having Quasi-Stable States and Their State Reduction" in IEICE TRANSACTIONS on transactions,
vol. E64-E, no. 3, pp. 147-154, March 1981, doi: .
Abstract: Asynchronous sequential circuits, obtained by generalizing the astable multivibrator and monostable one as sequential circuits having state-transitions among any number of stable states and quasi-stable states, are called sequential circuits having quasistable states (SCQ's). Moreover, a mathematical model of the SCQ is called the sequential machine having quasi-stable states (SMQ). This paper is devoted mainly to the state reduction problem of the SMQ. There are two types of the SMQ's (celled type I and type II). The difference between the types is the specifications of each quasi-stable duration. Thus this paper describes state reduction methods for type I and type II, where the latter utilizes the former. The systematic state reduction methods described in this paper become considerably more complicated than that for conventional sequential machines, because of the particularity of the quasistable state. Of course, this method is an extension of the state reduction method for the conventional asynchronous sequential machine. This paper includes a definition and representations of the SMQ, definitions of concepts available for the SMQ's, and their systematic state reduction methods.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e64-e_3_147/_p
Copy
@ARTICLE{e64-e_3_147,
author={Takeomi TAMESADA, },
journal={IEICE TRANSACTIONS on transactions},
title={Sequential Machines Having Quasi-Stable States and Their State Reduction},
year={1981},
volume={E64-E},
number={3},
pages={147-154},
abstract={Asynchronous sequential circuits, obtained by generalizing the astable multivibrator and monostable one as sequential circuits having state-transitions among any number of stable states and quasi-stable states, are called sequential circuits having quasistable states (SCQ's). Moreover, a mathematical model of the SCQ is called the sequential machine having quasi-stable states (SMQ). This paper is devoted mainly to the state reduction problem of the SMQ. There are two types of the SMQ's (celled type I and type II). The difference between the types is the specifications of each quasi-stable duration. Thus this paper describes state reduction methods for type I and type II, where the latter utilizes the former. The systematic state reduction methods described in this paper become considerably more complicated than that for conventional sequential machines, because of the particularity of the quasistable state. Of course, this method is an extension of the state reduction method for the conventional asynchronous sequential machine. This paper includes a definition and representations of the SMQ, definitions of concepts available for the SMQ's, and their systematic state reduction methods.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Sequential Machines Having Quasi-Stable States and Their State Reduction
T2 - IEICE TRANSACTIONS on transactions
SP - 147
EP - 154
AU - Takeomi TAMESADA
PY - 1981
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E64-E
IS - 3
JA - IEICE TRANSACTIONS on transactions
Y1 - March 1981
AB - Asynchronous sequential circuits, obtained by generalizing the astable multivibrator and monostable one as sequential circuits having state-transitions among any number of stable states and quasi-stable states, are called sequential circuits having quasistable states (SCQ's). Moreover, a mathematical model of the SCQ is called the sequential machine having quasi-stable states (SMQ). This paper is devoted mainly to the state reduction problem of the SMQ. There are two types of the SMQ's (celled type I and type II). The difference between the types is the specifications of each quasi-stable duration. Thus this paper describes state reduction methods for type I and type II, where the latter utilizes the former. The systematic state reduction methods described in this paper become considerably more complicated than that for conventional sequential machines, because of the particularity of the quasistable state. Of course, this method is an extension of the state reduction method for the conventional asynchronous sequential machine. This paper includes a definition and representations of the SMQ, definitions of concepts available for the SMQ's, and their systematic state reduction methods.
ER -
English
