Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata

Mathieu Lehaut, Anca Muscholl, Nir Piterman

TL;DR

This work shows first a simple, quadratic, distribution construction for asynchronous automata, where the process architecture is tree-like, and considers the problem of distributed controller synthesis and shows that it is decidable for tree-like architectures.

Abstract

We revisit constructions for distribution and synthesis of Zielonka's asynchronous automata in restricted settings. We show first a simple, quadratic, distribution construction for asynchronous automata, where the process architecture is tree-like. An architecture is tree-like if there is an underlying spanning tree of the architecture and communications are local on the tree. This quadratic distribution result generalizes the known construction for tree architectures and improves on an older, exponential construction for triangulated dependence alphabets. Lastly we consider the problem of distributed controller synthesis and show that it is decidable for tree-like architectures. This extends the decidability boundary from tree architectures to tree-like keeping the same $\text{Tower}_d(n)$ complexity bound, where $n$ is the size of the system and $d \ge 0$ the depth of the process tree.

From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata

TL;DR

This work shows first a simple, quadratic, distribution construction for asynchronous automata, where the process architecture is tree-like, and considers the problem of distributed controller synthesis and shows that it is decidable for tree-like architectures.

Abstract

We revisit constructions for distribution and synthesis of Zielonka's asynchronous automata in restricted settings. We show first a simple, quadratic, distribution construction for asynchronous automata, where the process architecture is tree-like. An architecture is tree-like if there is an underlying spanning tree of the architecture and communications are local on the tree. This quadratic distribution result generalizes the known construction for tree architectures and improves on an older, exponential construction for triangulated dependence alphabets. Lastly we consider the problem of distributed controller synthesis and show that it is decidable for tree-like architectures. This extends the decidability boundary from tree architectures to tree-like keeping the same complexity bound, where is the size of the system and the depth of the process tree.
Paper Structure (5 sections, 1 theorem)

This paper contains 5 sections, 1 theorem.

Table of Contents

  1. Introduction
  2. Preliminaries
  3. Deterministic Finite Automata
  4. Asynchronous Automata
  5. Tree-like communication architectures

Key Result

theorem thmcountertheorem

Given an $I(\mathbb{C}\xspace)$-diamond deterministic automaton $\mathcal{A}$, there exists an AA $\mathcal{B}$ that distributively recognizes the language of $\mathcal{A}$. In general, if $\mathcal{A}$ has $n$ states then every process of $\mathcal{B}$ has $O(4^{|\mathbb{P}|^4} n^{|\mathbb{P}|^2})$

Theorems & Definitions (2)

  • theorem thmcountertheorem: Zielonka87GenestGMW10KrishnaM13
  • definition thmcounterdefinition