Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikl. Diskr. Mat. Suppl., 2015, Issue 8, Pages 120–123 (Mi pdma236)  

Applied Theory of Coding, Automata and Graphs

Low power race-free state assignment of an asynchronous automaton

Yu. V. Pottosin

United Institute of Informatics Problems of the National Academy of Sciences of Belarus, Minsk

Abstract: 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.

Keywords: asynchronous automaton, race-free state assignment, low power state assignment.

DOI: https://doi.org/10.17223/2226308X/8/46

Full text: PDF file (533 kB)
References: PDF file   HTML file

UDC: 512.6

Citation: Yu. V. Pottosin, “Low power race-free state assignment of an asynchronous automaton”, Prikl. Diskr. Mat. Suppl., 2015, no. 8, 120–123

Citation in format AMSBIB
\Bibitem{Pot15}
\by Yu.~V.~Pottosin
\paper Low power race-free state assignment of an asynchronous automaton
\jour Prikl. Diskr. Mat. Suppl.
\yr 2015
\issue 8
\pages 120--123
\mathnet{http://mi.mathnet.ru/pdma236}
\crossref{https://doi.org/10.17223/2226308X/8/46}


Linking options:
  • http://mi.mathnet.ru/eng/pdma236
  • http://mi.mathnet.ru/eng/pdma/y2015/i8/p120

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Prikladnaya Diskretnaya Matematika. Supplement
    Number of views:
    This page:330
    Full text:53
    References:13

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022