Abstract:
When describing a distributed application within the UNITY framework, one
usually uses the composition by union to express the interaction between
processes. Unfortunately, the semantics of union is
not well-suited to express the possible true parallelism between the
different parts of a program. However, the different processes of a
distributed application do not share any memory. Thanks to this
particularity and the definition of an abstract communication model, the
composition by union can be modified to fit the parallelism of distributed
programs. This paper gives a set of theorems that characterize the
UNITY properties of a union program that remain valid when the processes
of the program are composed with the new operator. Therefore, this operator
can be used to formalize the mapping of programs to distributed architectures.
Michel Charpentier <
>
Last modified: Thu Feb 10 13:36:55 EST 2000