Un modèle asynchrone pour les systèmes distribués

Abstract

Many researchers are engaged in the field of distributed systems modelization. We present a new model inspired by the language theory. Its particularity within this theory is the rejection of interleaving for the representation of concurrency. Here, the main ideas are born from languages such as CSP or ESTELLE. The point is mainly the real lack of dependency between processes apart from synchronisations, which are rendez-vous. Once the model is defined, we introduce, as in the infinitary free monoïd, notions such as length, concatenation, prefix order, upper bound and infinite product. So the distributed model is provided with all the operations necessary to develop semantics. Then, we prove that the finitary part of the distributed model is isomorphic to the free partially commutative monoïd (fpcm). Finally, we settle the bases of an infinitary extension of the fpcm.