Distributed algorithms have many mission-critical applications ranging from embedded
systems and replicated databases to cloud computing. Due to asynchronous …

Mobile robot networks emerged in the past few years as a promising distributed computing
model. Existing work in the literature typically ensures the correctness of mobile robot …

Parameterized model checking is the problem of deciding if a given formula holds
irrespective of the number of participating processes. A standard approach for solving the …

Threshold guards are a basic primitive of many fault-tolerant algorithms that solve classical
problems of distributed computing, such as reliable broadcast, two-phase commit, and …

Automatic verification of threshold-based fault-tolerant distributed algorithms (FTDA) is
challenging: FTDAs have multiple parameters that are restricted by arithmetic conditions, the …

Counter abstraction is a powerful tool for parameterized model checking, if the number of
local states of the concurrent processes is relatively small. In recent work, we introduced …

We present a formal model of a distributed consensus algorithm in the executable
specification language Promela extended with a new type of guards, called counting guards …

Distributed algorithms have numerous mission-critical applications in embedded avionic
and automotive systems, cloud computing, computer networks, hardware design, and the …

As distributed, communication-based protection systems become more prevalent in the
emerging smart grid, the task of critically assessing their reliability has become increasingly …

In rendez-vous protocols an arbitrarily large number of indistinguishable finite-state agents
interact in pairs. The cut-off problem asks if there exists a number B such that all initial …