Integrating Distributed Algorithms into Distributed Systems

Article type: Research Article

Authors: Kindler, Ekkart | Peuker, Sibylle

Affiliations: Humboldt-Universität zu Berlin, Institut für Informatik, D-10099 Berlin, Germany

Note: [] Address for correspondence: Humboldt-Universität zu Berlin, Institut für Informatik, D-10099 Berlin

Abstract: A distributed algorithm is often used as a part of a larger distributed system. Usually, the properties of an algorithm are proven for the algorithm in isolation. Then, it is not obvious how the algorithm behaves when integrated into a larger system. In this paper, we present a simple technique which allows to derive properties of an algorithm which is integrated into a distributed system from the properties of the algorithm in isolation. The technique exploits the fact that some actions of a distributed algorithm do not belong to the algorithm but are triggered by the environment. If these actions are distinguished and are adequately considered in the verification of the algorithm, basically all properties are still valid for the algorithm as a part of a larger distributed system. This result will be formalized in the setting of the Distributed Algorithms' Working Notation (DAWN). Based on this result, we will give a proof rule which allows to prove liveness properties of a system from liveness properties of the involved distributed algorithm.

Keywords: Distributed Algorithms, Petri Nets, Compositionality, Temporal Logic

DOI: 10.3233/FI-1999-37306

Journal: Fundamenta Informaticae, vol. 37, no. 3, pp. 291-309, 1999