The maturity of a field of research is probably best characterized by the existence of
handbooks that explain its problems, results, applications, and methodology; allow their …

The aim of this paper is the study of asynchronous automata, a special kind of automata
which encode the independency relation between actions and which enable their …

We tackle a natural problem from distributed computing, involving time-stamps. Let?={p 1, p
2,…, p N} be a set of computing agents or processes which synchronize with each other from …

Event structures are a poset-based model for describing the behaviour of distributed
systems. They give rise to a well-understood class of Scott domains. Event structures are …

An asynchronous automaton consists of a set of processes that cooperate in processing
letters of the input. Each letter read prompts some of the processes to synchronize and …

An extension of the notions of traces and of asynchronous automata Page 1 INFORMATIQUE
THÉORIQUE ET APPLICATIONS A. ARNOLD An extension of the notions of traces and of …

In this paper we compare and study some properties of two mathematical models of
concurrent systems, asynchronous automata (Zielonka, 1987) and asynchronous cellular …

We present a subset automaton construction for asynchronous cellular automata. This
provides an answer to the problem of direct determinization for asynchronous cellular …

Consider a distributed system running a protocol in which processes exchange information
by passing messages. The gossip problem for the protocol is the following: Whenever a …

In this paper we state a new characterization of the class of recognizable trace languages
[Maz77]: we prove that this class coincides with the minimal class of trace languages …