An Efficient Algorithm for Deriving Logic Functions of Asynchronous Circuits

Toshiyuki MIYAMOTO; Sadatoshi KUMAGAI

An Efficient Algorithm for Deriving Logic Functions of Asynchronous Circuits

Toshiyuki MIYAMOTO, Sadatoshi KUMAGAI

Full Text Views

0

Cite this

Summary :

Signal Transition Graphs (STG'S) [1] are Petrinets [2], 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 Occurrence nets (OCN) and its prefix, called unfollding, has been proposed [3], [4]. OCN's can represent both causality and concurrency between two nodes by net stryctyre. In this paper, we propose an efficient algorithm to derive a logic function by generating sub-state space of a given STG using the structural properties of OCN. The proposed algorithm can be seem as a parallel algorithm for deriving a logic function.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.6 pp.818-824

Publication Date: 1996/06/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section of Papers Selected from 1995 Joint Technical Conference on Circuits/Systems, Computers and Communications (JTC-CSCC '95))

Category

Cite this

Copy

Toshiyuki MIYAMOTO, Sadatoshi KUMAGAI, "An Efficient Algorithm for Deriving Logic Functions of Asynchronous Circuits" in IEICE TRANSACTIONS on Fundamentals, vol. E79-A, no. 6, pp. 818-824, June 1996, doi: .
Abstract: Signal Transition Graphs (STG'S) [1] are Petrinets [2], 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 Occurrence nets (OCN) and its prefix, called unfollding, has been proposed [3], [4]. OCN's can represent both causality and concurrency between two nodes by net stryctyre. In this paper, we propose an efficient algorithm to derive a logic function by generating sub-state space of a given STG using the structural properties of OCN. The proposed algorithm can be seem as a parallel algorithm for deriving a logic function.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e79-a_6_818/_p

Copy

@ARTICLE{e79-a_6_818,
author={Toshiyuki MIYAMOTO, Sadatoshi KUMAGAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Algorithm for Deriving Logic Functions of Asynchronous Circuits},
year={1996},
volume={E79-A},
number={6},
pages={818-824},
abstract={Signal Transition Graphs (STG'S) [1] are Petrinets [2], 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 Occurrence nets (OCN) and its prefix, called unfollding, has been proposed [3], [4]. OCN's can represent both causality and concurrency between two nodes by net stryctyre. In this paper, we propose an efficient algorithm to derive a logic function by generating sub-state space of a given STG using the structural properties of OCN. The proposed algorithm can be seem as a parallel algorithm for deriving a logic function.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - An Efficient Algorithm for Deriving Logic Functions of Asynchronous Circuits
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 818
EP - 824
AU - Toshiyuki MIYAMOTO
AU - Sadatoshi KUMAGAI
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1996
AB - Signal Transition Graphs (STG'S) [1] are Petrinets [2], 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 Occurrence nets (OCN) and its prefix, called unfollding, has been proposed [3], [4]. OCN's can represent both causality and concurrency between two nodes by net stryctyre. In this paper, we propose an efficient algorithm to derive a logic function by generating sub-state space of a given STG using the structural properties of OCN. The proposed algorithm can be seem as a parallel algorithm for deriving a logic function.
ER -