HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON
The problem of race free state-assignment of an asynchronous automaton minimizing the switching activity of memory elements in an implementing circuit is considered. A heuristic method to solve this problem for an asynchronous automaton is suggested where the critical races between memory elements o...
| 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/77 |
| _version_ | 1797877362793119744 |
|---|---|
| author | Yu. V. Pottosin |
| author_facet | Yu. V. Pottosin |
| author_sort | Yu. V. Pottosin |
| collection | DOAJ |
| description | The problem of race free state-assignment of an asynchronous automaton minimizing the switching activity of memory elements in an implementing circuit is considered. A heuristic method to solve this problem for an asynchronous automaton is suggested where the critical races between memory elements of the implementing circuit are eliminated. |
| first_indexed | 2024-04-10T02:17:06Z |
| format | Article |
| id | doaj.art-2a25bedfa4b74310a820486e3fa527d3 |
| institution | Directory Open Access Journal |
| issn | 1816-0301 |
| language | Russian |
| last_indexed | 2024-04-10T02:17:06Z |
| publishDate | 2016-09-01 |
| publisher | The United Institute of Informatics Problems of the National Academy of Sciences of Belarus |
| record_format | Article |
| series | Informatika |
| spelling | doaj.art-2a25bedfa4b74310a820486e3fa527d32023-03-13T08:32:17ZrusThe United Institute of Informatics Problems of the National Academy of Sciences of BelarusInformatika1816-03012016-09-010311312376HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATONYu. V. Pottosin0Объединенный институт проблем информатики НАН БеларусиThe problem of race free state-assignment of an asynchronous automaton minimizing the switching activity of memory elements in an implementing circuit is considered. A heuristic method to solve this problem for an asynchronous automaton is suggested where the critical races between memory elements of the implementing circuit are eliminated.https://inf.grid.by/jour/article/view/77 |
| spellingShingle | Yu. V. Pottosin HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON Informatika |
| title | HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON |
| title_full | HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON |
| title_fullStr | HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON |
| title_full_unstemmed | HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON |
| title_short | HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON |
| title_sort | heuristic method for low power race free state assignment of an asynghronous automaton |
| url | https://inf.grid.by/jour/article/view/77 |
| work_keys_str_mv | AT yuvpottosin heuristicmethodforlowpowerracefreestateassignmentofanasynghronousautomaton |