Alea jacta est. With the printing of this thesis, almost five years of research end. This was a
period of hard work, of astonishing elegance and beauty present in concurrency theory, with …

The IEEE 1394 Root Contention Protocol is an industrial leader election algorithm for two
processes in which probability, real time and parameters play an important role. This …

We present a probabilistic leader election algorithm for anonymous, bidirectional,
asynchronous rings. It is based on an algorithm from Franklin 22, augmented with random …

We revisit the IEEE 1394 high-performance serial bus (" FireWire"), which became a success
story in formal methods after three PhD students, by using process algebra and model …

We present three descriptions, at different abstract levels, of the tree identify protocol from
the IEEE 1394 serial multimedia bus standard. The descriptions are given using the …

We propose a probabilistic network model, called asynchronous bounded expected delay
(ABE), which requires a known bound on the expected message delay. In ABE networks all …

In this paper we consider two descriptions in Maude of the leader election protocol from the
IEEE 1394 serial multimedia bus. Particularly, the time aspects of the protocol are studied …

The physical layer of the IEEE 1394 (FireWire, i-Link) architecture contains a protocol for
spanning a tree in the network topology, which fails if the topology contains a loop. We show …

We introduce a comparative case study on the application of formal methods and techniques
to the Tree Identify Protocol of the IEEE standard 1394 serial multimedia bus. The Tree …

We propose a natural generalisation of asynchronous bounded delay (ABD) network
models. The commonly used ABD models assume a known bound on message delay. This …