Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.10708 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911996213985280 |
|---|---|
| author | Hausmann, Daniel Lehaut, Mathieu Piterman, Nir |
| author_facet | Hausmann, Daniel Lehaut, Mathieu Piterman, Nir |
| contents | We study how to distribute trace languages in a setting where processes communicate via reconfigurable communication channels. That is, the different processes can connect and disconnect from channels at run time. We restrict attention to communication via tree-like communication architectures. These allow channels to connect more than two processes in a way that maintains an underlying spanning tree and keeps communication continuous on the tree. We make the reconfiguration explicit in the language allowing both a centralized automaton as well as the distributed processes to share relevant information about the current communication configuration. We show that Zielonka's seminal result regarding distribution of regular languages for asynchronous automata can be generalized in this setting, incorporating both reconfiguration and more than binary tree architectures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_10708 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology Hausmann, Daniel Lehaut, Mathieu Piterman, Nir Formal Languages and Automata Theory We study how to distribute trace languages in a setting where processes communicate via reconfigurable communication channels. That is, the different processes can connect and disconnect from channels at run time. We restrict attention to communication via tree-like communication architectures. These allow channels to connect more than two processes in a way that maintains an underlying spanning tree and keeps communication continuous on the tree. We make the reconfiguration explicit in the language allowing both a centralized automaton as well as the distributed processes to share relevant information about the current communication configuration. We show that Zielonka's seminal result regarding distribution of regular languages for asynchronous automata can be generalized in this setting, incorporating both reconfiguration and more than binary tree architectures. |
| title | Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2408.10708 |