arXiv:2305.01425 · v8

Adding Reconfiguration to Zielonka's Asynchronous Automata

首次提交 2023-05-02 21:55

版本更新 2026-10-26 23:43

雷达观测 2026-10-29 00:35

摘要

We study an extension of Zielonka's (fixed) asynchronous automata called reconfigurable asynchronous automata where processes can dynamically change who they communicate with. We show that reconfigurable asynchronous automata are not more expressive than fixed asynchronous automata by giving translations from one to the other. However, going from reconfigurable to fixed comes at the cost of disseminating communication (and knowledge) to all processes in the system. We then show that this is unavoidable by describing a language accepted by a reconfigurable automaton such that in every equivalent fixed automaton, every process must either be aware of all communication or be irrelevant.