This repository contains exercises for the Concurrency Theory course, focusing on practical implementations and analysis of concurrent systems.
-
Dining Philosophers Problem
Compare different solutions and implementations of the classic five philosophers problem. -
Trace Theory & Graph Grammars
- Use trace theory for thread scheduling.
- Represent concurrent threads using graph grammars, where production execution models thread execution.
- Example: transaction sequences modifying variables.
-
Concurrent Linear Algebra Algorithms
- Apply trace theory for thread scheduling in classical linear algebra algorithms.
- Example: concurrent Gaussian elimination.