State assignment of asynchronous parallel automata

被引：0
|
作者：
Cheremisinova, L [1 ]
机构：
[1] Natl Acad Sci Belarus, Inst Engn Cybernet, Minsk 220012, BELARUS
来源：
DESDES '1: PROCEEDINGS OF THE INTERNATIONAL WORKSHOP ON DISCRETE-EVENT SYSTEM DESIGN | 2001年
关键词：
parallel automaton; partial state assignment; races in asynchronous automata;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A problem of race-free state assignment of asynchronous parallel automata is considered The goal is to encode partial states of parallel automaton using minimal number of coding variables and excluding critical races during automaton operation, Requirements imposing on the partial states codes to eliminate the influence of races are formulated. An exact algorithm to find a minimal solution of the problem of race-free state assignment for parallel automata is suggested. The algorithm provides reducing the computational effort when searching state encoding.
引用
收藏
页码：127 / 132
页数：6
相关论文
共 50 条
12345