On Distributed Languages and Models for Distributed Computation

This paper may be seen as proposing a tentative synthesis of various models of parallelism : we establish representation results for three kinds of Models for Distributed Systems, Labelled Transition Systems, Labelled Event Structures and Distributed Languages. For that purpose, we introduce a new representation model for concurrent systems, the Distributed Languages. Based on Words and Equivalence Relations, they are generalizations of the Trace Languages and model the behaviour of any asynchronous concurrent system.