Asynchronous wreath product and cascade decompositions for concurrent behaviours

TL;DR

This paper introduces algebraic tools for reasoning about concurrent behaviors modeled by Mazurkiewicz traces, including an asynchronous wreath product, a decomposition theorem, and automata operations, advancing the understanding of true concurrency.

Contribution

It develops an asynchronous wreath product operation, proves a Krohn-Rhodes-like decomposition for trace languages, and introduces distributed automata operations for modeling concurrency.

Findings

Asynchronous wreath product characterizes trace languages recognized by such products.

Decomposition theorem analogous to Krohn-Rhodes for recognizable trace languages.

Distributed automata operations characterize trace languages definable in first-order logic.

Abstract

We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These tools reflect the distributed nature of traces and the underlying causality and concurrency between events, and can be said to support true concurrency. They generalize the tools that have been so efficient in understanding, classifying and reasoning about word languages. In particular, we introduce an asynchronous version of the wreath product operation and we describe the trace languages recognized by such products (the so-called asynchronous wreath product principle). We then propose a decomposition result for recognizable trace languages, analogous to the Krohn-Rhodes theorem, and we prove this decomposition result in the special case of acyclic architectures. Finally, we introduce and analyze two distributed automata-theoretic operations. One, the local cascade product, is a direct implementation of the asynchronous wreath product operation. The other, global cascade sequences, although conceptually and operationally similar to the local cascade product, translates to a more complex asynchronous implementation which uses the gossip automaton of Mukund and Sohoni. This leads to interesting applications to the characterization of trace languages definable in first-order logic: they are accepted by a restricted local cascade product of the gossip automaton and 2-state asynchronous reset automata, and also by a global cascade sequence of 2-state asynchronous reset automata. Over distributed alphabets for which the asynchronous Krohn-Rhodes theorem holds, a local cascade product of such automata is sufficient and this, in turn, leads to the identification of a simple temporal logic which is expressively complete for such alphabets.