Concurrency Testing of PBFT: How do different exploration strategies perform for detecting concurrency bugs in PBFT?

Consensus algorithms, as well as distributed systems in general, are vulnerable to concurrency bugs due to non-determinism. Such bugs are hard to detect since it is necessary to test using a lot of different scenarios and even then, there is no guarantee to find one. <br/><br/>Controlled concurrency testing is a proposed solution to that problem...

Decreasing message complexity in Byzantine Fault Tolerant communications using Consistent-Broadcast

During this research we have replaced Bracha’s layer in the state-of-the-art Bracha-Dolev protocol to improve the performance by decreasing the message complexity of the protocol running on top of a given network topology so long as the requirements stated by Bracha and Dolev are met. Bracha-Dolev is an algorithm that is used to establish a...

Effect of Sensory Faults within Robot Swarms

Robotic swarms provide a great many uses within a world increasingly relying on autonomous systems. Alas these swarms are also very vulnerable to faults, even the smallest fault can cripple the performance of a whole swarm. Such a fault could be one of several types; those that have to do with sensors, communication, ... This paper will try to...