Asynchronous mappings and asynchronous cellular automata
Résumé
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 concurrent execution. These automata, introduced by Zielonka, constitute a natural extension of finite automata to the case of asynchronous parallelism. Their behaviour is described by trace languages, subsets of partially commutative monoids. The main result concerning this class of automata states that they accept exactly all recognizable trace languages. In this paper we give new improved constructions of asynchronous automata. In the final part of the paper we present a distributed system of messages with bounded time-stamps based on asynchronous automata.