An important problem in the field of distributed systems is that of detecting the termination of
a distributed computation. Distributed termination detection (DTD) is a difficult problem due …

Coordinating the interactions of applications running on the diversity of both mobile and
embedded devices that will be common in ubiquitous computing environments is still a …

We propose a new algorithm for detecting termination of distributed systems. The algorithm
works correctly whether the system is static or dynamic, whether the interprocess …

We examine the power and limitations of the weakest vertex relabelling system which allows
to change a label of a vertex in function of its own label and of the label of one of its …

An efficient decentralized algorithm for synchronized termination of a distributed
computation is presented. It is assumed that distributed processes are connected via …

We study the election and the naming problems in the asynchronous message passing
model. We present a necessary condition based on Angluin's lifting lemma [1] that must be …

We present a general method and a toolkit for designing, implementing and visualizing
distributed algorithms. We make use of the high level encoding of distributed algorithms as …

This paper presents a distributed algorithm to simultaneously compute the diameter, radius
and node eccentricity in all nodes of a synchronous network. Such topological information …

Abstract Girard's Geometry of Interaction offers a low-level decomposition of the cut-
elimination process in linear logic, which can be used as a compilation technique for …

We examine the power and limitations of the weakest vertex relabelling system which allows
to change a label of a vertex in function of its own label and of the label of one of its …