LOW POWER RACE-FREE STATE ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON
The problem of a race free state assignment of an asynchronous automaton is considered. A method for the state assignment is suggested that provides the minimization of the number and theswitching activity of the memory elements along with the elimination of the critical races betweenthem.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
The United Institute of Informatics Problems of the National Academy of Sciences of Belarus
2016-09-01
|
| Series: | Informatika |
| Online Access: | https://inf.grid.by/jour/article/view/24 |
| id |
doaj-21fc3fb4bf15477a95965d9aba46df9d |
|---|---|
| record_format |
Article |
| spelling |
doaj-21fc3fb4bf15477a95965d9aba46df9d2021-07-28T21:07:21ZrusThe United Institute of Informatics Problems of the National Academy of Sciences of Belarus Informatika1816-03012016-09-01029410123LOW POWER RACE-FREE STATE ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATONYu. V. Pottosin0Объединенный институт проблем информатики НАН БеларусиThe problem of a race free state assignment of an asynchronous automaton is considered. A method for the state assignment is suggested that provides the minimization of the number and theswitching activity of the memory elements along with the elimination of the critical races betweenthem.https://inf.grid.by/jour/article/view/24 |
| collection |
DOAJ |
| language |
Russian |
| format |
Article |
| sources |
DOAJ |
| author |
Yu. V. Pottosin |
| spellingShingle |
Yu. V. Pottosin LOW POWER RACE-FREE STATE ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON Informatika |
| author_facet |
Yu. V. Pottosin |
| author_sort |
Yu. V. Pottosin |
| title |
LOW POWER RACE-FREE STATE ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON |
| title_short |
LOW POWER RACE-FREE STATE ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON |
| title_full |
LOW POWER RACE-FREE STATE ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON |
| title_fullStr |
LOW POWER RACE-FREE STATE ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON |
| title_full_unstemmed |
LOW POWER RACE-FREE STATE ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON |
| title_sort |
low power race-free state assignment of an asynghronous automaton |
| publisher |
The United Institute of Informatics Problems of the National Academy of Sciences of Belarus |
| series |
Informatika |
| issn |
1816-0301 |
| publishDate |
2016-09-01 |
| description |
The problem of a race free state assignment of an asynchronous automaton is considered. A method for the state assignment is suggested that provides the minimization of the number and theswitching activity of the memory elements along with the elimination of the critical races betweenthem. |
| url |
https://inf.grid.by/jour/article/view/24 |
| work_keys_str_mv |
AT yuvpottosin lowpowerracefreestateassignmentofanasynghronousautomaton |
| _version_ |
1721262957872021504 |