Metoda ladeni distribuovanych aplikaci.

A distributed computation describes the execution of a distributed program by a collection of several processes. We assume that every process can communicate with every other process. The activity of each process can be modeled by a sequence of events. An event may be either internal (i.e. a change of a process local state) or it may involve communication with another process. This work assumes an asynchronous distributed system shich is characterized by the following properties: there are no bounds on the relative speed of processes and there exist no bounds on message delays. Thus, the asynchronous distributed computation is nondeterministic in the sense that every run the of computation (even for the same data input) yields a different sequence of global states where a global state is a set of local states of processes.Available from STL, Prague, CZ / NTK - National Technical LibrarySIGLECZCzech Republi