In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing,
and analyzing distributed algorithms. She directs her book at a wide audience, including …

A wait-free implementation of a concurrent data object is one that guarantees that any
process can complete any operation in a finite number of steps, regardless of the execution …

In order to apply formal methods in practice, the practitioner has to comprehend a vast
amount of research literature and realistically evaluate practical merits of different …

This tutorial presents an overview of model checking for both discrete and continuous-time
Markov chains (DTMCs and CTMCs). Model checking algorithms are given for verifying …

Emulators that translate algorithms from the shared-memory model to two different message-
passing models are presented. Both are achieved by implementing a wait-free, atomic …

This tutorial provides an introduction to probabilistic model checking, a technique for
automatically verifying quantitative properties of probabilistic systems. We focus on Markov …

In this paper we describe PRISM, a tool being developed at the University of Birmingham for
the analysis of probabilistic systems. PRISM supports three probabilistic models: discrete …

This paper introduces a general formulation of atomic snapshot memory, a shared memory
partitioned into words written (updated) by individual processes, or instantaneously read …

Modeling and Veri cation of Randomized Distributed Real-Time Systems Page 1 Modeling and
Veri cation of Randomized Distributed Real-Time Systems by Roberto Segala SM, Electrical …

We introduce obstruction-freedom, a new nonblocking property for shared data structure
implementations. This property is strong enough to avoid the problems associated with …