Verifying a distributed system with combinatorial topology

Formal verification of distributed systems is hard and expensive. Modern systems rely on tools like observability, extensive testing, and more recenty, chaos engineering. Understanding the maths behind distributed computing, and being able to express systems in terms of algebraic topology and graph theory brings a new possibility of formal verification and a new approach towards solving complex problems and their interconnections.

OBJECTIVES

Propose a faster way to verify a distributed system, communicating the application of combinatorial topology in real world problems.