Reconfigurable async automata equal fixed ones in power via translations, but any equivalent fixed automaton must disseminate all communication knowledge to every process or render some irrelevant.
Notes on finite asynchronous automata
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Adding Reconfiguration to Zielonka's Asynchronous Automata
Reconfigurable async automata equal fixed ones in power via translations, but any equivalent fixed automaton must disseminate all communication knowledge to every process or render some irrelevant.