Fault tolerance in distributed computing is a wide area with a significant body of literature
that is vastly diverse in methodology and terminology. This paper aims at structuring the …

Embedded systems for safety-critical applications often integrate multiple “functions” and
must generally be fault-tolerant. These requirements lead to a need for mechanisms and …

SBFT is a state of the art Byzantine fault tolerant state machine replication system that
addresses the challenges of scalability, decentralization and global geo-replication. SBFT is …

Tendermint is a new protocol for ordering events in a distributed network under adversarial
conditions. More commonly known as consensus or atomic broadcast, the problem has …

Quantum communication networks are crucial for both secure communication and
cryptographic networked tasks. Building quantum communication networks in a scalable …

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

* Comprehensive introduction to the fundamental results in the mathematical foundations of
distributed computing* Accompanied by supporting material, such as lecture notes and …

Graph grammars originated in the late 60s, motivated by considerations about pattern
recognition and compiler construction. Since then the list of areas which have interacted with …

This paper considers a variant of the Byzantine Generals problem, in which processes start
with arbitrary real values rather than Boolean values or values from some bounded range …

Consensus is arguably one of the most fundamental problems in distributed computing,
playing also an important role in the area of cryptographic protocols as the enabler of a …