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 条

[1] State assignment of an asynchronous parallel automaton
Cheremisinova, LD
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2004, 43 (05) : 743 - 750
[2] On optimal state-assignment of synchronous parallel automata
Pottosin, Y
DESDES '1: PROCEEDINGS OF THE INTERNATIONAL WORKSHOP ON DISCRETE-EVENT SYSTEM DESIGN, 2001, : 85 - 90
[3] ALGORITHM FOR ASSIGNMENT OF INTERNAL STATES TO ASYNCHRONOUS FINITE AUTOMATA
KAJEVCHENKO, MA
AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1978, (05): : 11 - 17
[4] Parallel simulation of asynchronous cellular automata evolution
Bandman, Olga
CELLULAR AUTOMATA, PROCEEDINGS, 2006, 4173 : 41 - 47
[5] Asynchronous Parallel Communicating Systems of Pushdown Automata
Otto, Friedrich
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (05) : 643 - 666
[6] Asynchronous Systems of Parallel Communicating Finite Automata
Vollweiler, Marcel
FUNDAMENTA INFORMATICAE, 2015, 136 (1-2) : 177 - 197
[7] IMPLICANTS REDUCTION DURING THE INTERNAL STATE ASSIGNMENT OF ASYNCHRONOUS AUTOMATA, REALIZED ON THE PROGRAMMABLE LOGIC ARRAY
LEMBERSKIJ, IG
AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1979, (02): : 59 - 65
[8] INTERNAL STATE ASSIGNMENT FOR ASYNCHRONOUS FINITE AUTOMATA WITH A VIEW TO IMPLEMENTATION USING PROGRAMMABLE LOGIC ARRAYS.
Lemberskii, I.G.
Fritsnovich, G.F.
Chapenko, V.P.
Automatic Control and Computer Sciences, 1976, 10 (04): : 10 - 17
[9] STATE ASSIGNMENTS FOR ASYNCHRONOUS AUTOMATA WITH BISTABLE CELLS
GURTOVCEV, AL
PETRENKO, AF
CHAPENKO, VP
AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1978, (05): : 1 - 10
[10] Asynchronous cellular automata and asynchronous automata for pomsets
Kuske, D
CONCUR'98: CONCURRENCY THEORY, 1998, 1466 : 517 - 532

← 1 2 3 4 5 →