Includes Final Project (Python), Wireshark Labs, and Theoretical HWs

Minimum state products on Dijkstra's self-stabilizing token ring — exact values for n = 3 through 9 and a large-n conjecture supported through n = 10. Paper, sorry-free Lean 4 formalization, Python research probes, and an independent verifier.

Implementation of Lelann's token-ring algorithm, supporting process failures and insertion/removal of processes.

A solution to the famous Dining Philosophers problem using the Token Ring approach.