In: LNCS 2154: CONCUR 2001 - Concurrency Theory, pages 184-pp. 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings / K. G. Larsen, M. Nielsen (Eds.) --- Springer Verlag, 2001.
Abstract: A non-sequential, i.e. "true concurrency", semantics for randomized distributed algorithms is suggested. It is based on Petri nets and their branching processes. We introduce randomized Petri nets and their semantics, probabilistic branching processes. As a main result, we show that each probabilistic branching process defines a unique canonical probability space. Finally, we show that the non-sequential semantics differs from the classical sequential semantics, modelling a new adversary, called the distributed adversary.