HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON

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

Full description

Bibliographic Details
Main Author: Yu. V. Pottosin
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
id doaj-2a25bedfa4b74310a820486e3fa527d3
record_format Article
spelling doaj-2a25bedfa4b74310a820486e3fa527d32021-07-28T21:07:21ZrusThe United Institute of Informatics Problems of the National Academy of Sciences of Belarus Informatika1816-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
collection DOAJ
language Russian
format Article
sources DOAJ
author Yu. V. Pottosin
spellingShingle Yu. V. Pottosin
HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON
Informatika
author_facet Yu. V. Pottosin
author_sort Yu. V. Pottosin
title 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_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_sort heuristic method for 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 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.
url https://inf.grid.by/jour/article/view/77
work_keys_str_mv AT yuvpottosin heuristicmethodforlowpowerracefreestateassignmentofanasynghronousautomaton
_version_ 1721262961276747776

Similar Items