Geodesic
Low power race-free state assignment of an asynchronous automaton
Prikladnaya Diskretnaya Matematika. Supplement, no. 8 (2015), pp. 120-123 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The problem of race-free state assignment in an asynchronous automaton is considered in a formulation where both the length of state code and the switching activity of memory elements should be minimized. To solve this problem the author uses the approach that involves consideration of the pairs of transitions between states for establishing the absence conditions for critical races. This conditions are represented as rows of a ternary matrix called the condition matrix. The state codes of a given automaton are obtained as a result of covering the condition matrix rows by compatible sets of columns. To take into account the low switching activity of memory elements, the compatible sets and correspondingly the vectors related to them are supplied with weights. So, the problem of low power race-free state assignment of an asynchronous automaton is reduced to the weighted cover problem.
Mots-clés : asynchronous automaton
Keywords: race-free state assignment, low power state assignment. 
@article{PDMA_2015_8_a45,
     author = {Yu. V. Pottosin},
     title = {Low power race-free state assignment of an asynchronous automaton},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {120--123},
     year = {2015},
     number = {8},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2015_8_a45/}
}
TY  - JOUR
AU  - Yu. V. Pottosin
TI  - Low power race-free state assignment of an asynchronous automaton
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2015
SP  - 120
EP  - 123
IS  - 8
UR  - http://geodesic.mathdoc.fr/item/PDMA_2015_8_a45/
LA  - ru
ID  - PDMA_2015_8_a45
ER  - 
%0 Journal Article
%A Yu. V. Pottosin
%T Low power race-free state assignment of an asynchronous automaton
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2015
%P 120-123
%N 8
%U http://geodesic.mathdoc.fr/item/PDMA_2015_8_a45/
%G ru
%F PDMA_2015_8_a45
Yu. V. Pottosin. Low power race-free state assignment of an asynchronous automaton. Prikladnaya Diskretnaya Matematika. Supplement, no. 8 (2015), pp. 120-123. http://geodesic.mathdoc.fr/item/PDMA_2015_8_a45/

[1] Muroga S., Sistemnoe proektirovanie sverkhbolshikh integralnykh skhem, V 2-kh kn. Kn. 1, Mir, M., 1985

[2] Zakrevskii A. D., “Algoritmy energosberegayuschego kodirovaniya sostoyanii avtomata”, Informatika, 2011, no. 1(29), 68–78

[3] Zakrevskii A. D., “Nakhozhdenie rezhima maksimalnogo energopotrebleniya logicheskoi skhemy”, Prikladnaya diskretnaya matematika, 2012, no. 2, 100–104

[4] Zakrevskii A. D., Logicheskii sintez kaskadnykh skhem, Nauka, M., 1981 | MR