Geodesic
Signal transition graphs for asynchronous data path circuits
Modelirovanie i analiz informacionnyh sistem, Tome 30 (2023) no. 2, pp. 170-186

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper proposes a method for constructing signal transition graphs (STGs), which are directly mapped into asynchronous circuits for data processing. The advantage of the proposed method is that the resulting circuits are not only output-persistent, but also conformant to the environment. In other approaches, the environment is specified implicitly and/or inexactly and therefore they guarantee only output persistence. The conformation can be verified if both the circuit and its environment are specified by STGs. As an example, we consider a module realizing the function AND2. This module can either wait for both 1s or evaluate the function as soon as at least one 0 arrives. For each case, we draw up a separate STG (scenario) and map it into NCL gates. To provide such a mapping, we specify the behaviors of NCL gates by STG protocols. For data path, such an STG always contains alternative branches with the so-called garbage transitions at the gate inputs. The garbage transitions on a certain wire mean that the circuit is sensitive to the delay in this wire. Ignoring the garbage may lead to a violation of conformation or/and output persistence. For example, in the combinational part of the NCL circuits, the garbage appears on the inputs of NCL gates, and therefore these circuits are not delay insensitive.
Keywords: arithmetic, delay in wires, handshake, pipeline, verification, weak causality.
Mots-clés : conformation, decomposition 
@article{MAIS_2023_30_2_a4,
     author = {A. Kushnerov and S. Bystrov},
     title = {Signal transition graphs for asynchronous data path circuits},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {170--186},
     publisher = {mathdoc},
     volume = {30},
     number = {2},
     year = {2023},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2023_30_2_a4/}
}
TY  - JOUR
AU  - A. Kushnerov
AU  - S. Bystrov
TI  - Signal transition graphs for asynchronous data path circuits
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2023
SP  - 170
EP  - 186
VL  - 30
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2023_30_2_a4/
LA  - en
ID  - MAIS_2023_30_2_a4
ER  - 
%0 Journal Article
%A A. Kushnerov
%A S. Bystrov
%T Signal transition graphs for asynchronous data path circuits
%J Modelirovanie i analiz informacionnyh sistem
%D 2023
%P 170-186
%V 30
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2023_30_2_a4/
%G en
%F MAIS_2023_30_2_a4
A. Kushnerov; S. Bystrov. Signal transition graphs for asynchronous data path circuits. Modelirovanie i analiz informacionnyh sistem, Tome 30 (2023) no. 2, pp. 170-186. http://geodesic.mathdoc.fr/item/MAIS_2023_30_2_a4/