IEICE TRANSACTIONS on Information
An Algebraic Specification of a Daisy Chain Arbiter
Summary :
There have been few studies on formal approaches to the specification and realization of asynchronous sequential circuits. For synchronous sequential circuits, an algebraic method is proposed as one of such approaches, but it cannot be applied to asynchronous ones directly. This paper describes an algebraic method of specifying the abstract behavior of asynchronous sequential circuits. We select an daisy chain arbiter as an example of them. In the arbiter, state transitions are caused by input changes, and all the modules do not always make state transitions simultaneously. These are main obstacles to specify it in the same way as sychronous sequential circuits. In order to remove them, we modify the meaning of input in specifications and introduce pseudo state transitions so that we can regard all the modules as if they make state transitions simultaneously. This method can be applied to most of the other asynchronous sequential circuits.
- Publication
- IEICE TRANSACTIONS on Information Vol.E75-D No.6 pp.778-784
- Publication Date
- 1992/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Pacific Rim International Symposium on Fault Tolerant Systems)
- Category
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
Yu Rong HOU, Atsushi OHNISHI, Yuji SUGIYAMA, Takuji OKAMOTO, "An Algebraic Specification of a Daisy Chain Arbiter" in IEICE TRANSACTIONS on Information,
vol. E75-D, no. 6, pp. 778-784, November 1992, doi: .
Abstract: There have been few studies on formal approaches to the specification and realization of asynchronous sequential circuits. For synchronous sequential circuits, an algebraic method is proposed as one of such approaches, but it cannot be applied to asynchronous ones directly. This paper describes an algebraic method of specifying the abstract behavior of asynchronous sequential circuits. We select an daisy chain arbiter as an example of them. In the arbiter, state transitions are caused by input changes, and all the modules do not always make state transitions simultaneously. These are main obstacles to specify it in the same way as sychronous sequential circuits. In order to remove them, we modify the meaning of input in specifications and introduce pseudo state transitions so that we can regard all the modules as if they make state transitions simultaneously. This method can be applied to most of the other asynchronous sequential circuits.
URL: https://global.ieice.org/en_transactions/information/10.1587/e75-d_6_778/_p
Copy
@ARTICLE{e75-d_6_778,
author={Yu Rong HOU, Atsushi OHNISHI, Yuji SUGIYAMA, Takuji OKAMOTO, },
journal={IEICE TRANSACTIONS on Information},
title={An Algebraic Specification of a Daisy Chain Arbiter},
year={1992},
volume={E75-D},
number={6},
pages={778-784},
abstract={There have been few studies on formal approaches to the specification and realization of asynchronous sequential circuits. For synchronous sequential circuits, an algebraic method is proposed as one of such approaches, but it cannot be applied to asynchronous ones directly. This paper describes an algebraic method of specifying the abstract behavior of asynchronous sequential circuits. We select an daisy chain arbiter as an example of them. In the arbiter, state transitions are caused by input changes, and all the modules do not always make state transitions simultaneously. These are main obstacles to specify it in the same way as sychronous sequential circuits. In order to remove them, we modify the meaning of input in specifications and introduce pseudo state transitions so that we can regard all the modules as if they make state transitions simultaneously. This method can be applied to most of the other asynchronous sequential circuits.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - An Algebraic Specification of a Daisy Chain Arbiter
T2 - IEICE TRANSACTIONS on Information
SP - 778
EP - 784
AU - Yu Rong HOU
AU - Atsushi OHNISHI
AU - Yuji SUGIYAMA
AU - Takuji OKAMOTO
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - November 1992
AB - There have been few studies on formal approaches to the specification and realization of asynchronous sequential circuits. For synchronous sequential circuits, an algebraic method is proposed as one of such approaches, but it cannot be applied to asynchronous ones directly. This paper describes an algebraic method of specifying the abstract behavior of asynchronous sequential circuits. We select an daisy chain arbiter as an example of them. In the arbiter, state transitions are caused by input changes, and all the modules do not always make state transitions simultaneously. These are main obstacles to specify it in the same way as sychronous sequential circuits. In order to remove them, we modify the meaning of input in specifications and introduce pseudo state transitions so that we can regard all the modules as if they make state transitions simultaneously. This method can be applied to most of the other asynchronous sequential circuits.
ER -
English
