Let Math catch hidden issues in your logic — TLA+ and State Machines for simple concurrent software

TLA+ is a brilliant piece of software that helps you mathematically prove whether your logic is correct. It's especially powerful for tricky systems—like those involving concurrency or parallelism—where reasoning through every possible state is practically impossible for humans.

Despite being used in some of the most critical systems across different industries, TLA+ remains surprisingly underrated. Many engineers haven't even heard of it.

The goal of this video is to explore a small example, show how it works in practice, and hopefully spark some interest to try it yourself.



Music by Epidemic Sound:
Track 1: Groundhog Day By Auxjack
Track 2: Coastal Cashmere By Guustavv
Track 3: Break It Down By Dyalla
Track 4: nyota By baegel
Track 5: End of Time By Sebastian Winskog
Track 6: Cityscape By Mizlo
Track 7: Drank By damnsonic
Track 8: By the Fire By Rebecca Mardal
Track 9: Smitten By Rebecca Mardal
Track 10: Before I Wake By Mizlo
courtesy of www.epidemicsound.com


00:00 Intro
01:20 Writing simple concurrent soft
07:15 Describe TLA+ Specifications
14:18 Create and Run TLA+ Model
16:16 Reproduce bug in Python code
17:58 Update TLA+ specifications
25:03 Apply Fix to Python code
26:26 Epilogue