On Deriving Logic Functions of Asynchronous Circuits by STG Unfoldings
Summary :
Signal Transition Graphs (STG's) are Petri nets, which were introduced to represent a behavior of asynchronous circuits. To derive logic functions from an STG, the reachability graph should be constructed. In the verification of STG's some method based on an Occurrence net (OCN) and its prefix, called an unfolding, has been proposed. OCN's can represent both causality and concurrency between two nodes by net structure. In this paper, we propose a method to derive a logic function by generating sub state space of a given STG using the structural properties of OCN.
- Publication
- IEICE TRANSACTIONS on Information Vol.E80-D No.3 pp.336-343
- Publication Date
- 1997/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Asynchronous Circuit and System Design)
- Category
- Synthesis
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
Toshiyuki MIYAMOTO, Sadatoshi KUMAGAI, "On Deriving Logic Functions of Asynchronous Circuits by STG Unfoldings" in IEICE TRANSACTIONS on Information,
vol. E80-D, no. 3, pp. 336-343, March 1997, doi: .
Abstract: Signal Transition Graphs (STG's) are Petri nets, which were introduced to represent a behavior of asynchronous circuits. To derive logic functions from an STG, the reachability graph should be constructed. In the verification of STG's some method based on an Occurrence net (OCN) and its prefix, called an unfolding, has been proposed. OCN's can represent both causality and concurrency between two nodes by net structure. In this paper, we propose a method to derive a logic function by generating sub state space of a given STG using the structural properties of OCN.
URL: https://global.ieice.org/en_transactions/information/10.1587/e80-d_3_336/_p
Copy
@ARTICLE{e80-d_3_336,
author={Toshiyuki MIYAMOTO, Sadatoshi KUMAGAI, },
journal={IEICE TRANSACTIONS on Information},
title={On Deriving Logic Functions of Asynchronous Circuits by STG Unfoldings},
year={1997},
volume={E80-D},
number={3},
pages={336-343},
abstract={Signal Transition Graphs (STG's) are Petri nets, which were introduced to represent a behavior of asynchronous circuits. To derive logic functions from an STG, the reachability graph should be constructed. In the verification of STG's some method based on an Occurrence net (OCN) and its prefix, called an unfolding, has been proposed. OCN's can represent both causality and concurrency between two nodes by net structure. In this paper, we propose a method to derive a logic function by generating sub state space of a given STG using the structural properties of OCN.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - On Deriving Logic Functions of Asynchronous Circuits by STG Unfoldings
T2 - IEICE TRANSACTIONS on Information
SP - 336
EP - 343
AU - Toshiyuki MIYAMOTO
AU - Sadatoshi KUMAGAI
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E80-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1997
AB - Signal Transition Graphs (STG's) are Petri nets, which were introduced to represent a behavior of asynchronous circuits. To derive logic functions from an STG, the reachability graph should be constructed. In the verification of STG's some method based on an Occurrence net (OCN) and its prefix, called an unfolding, has been proposed. OCN's can represent both causality and concurrency between two nodes by net structure. In this paper, we propose a method to derive a logic function by generating sub state space of a given STG using the structural properties of OCN.
ER -
English
