Course contents
- In this course, we consider different abstract formalisms to model distribution, concurrency and communication. We also focus on systems that can exhibit infinite behaviours and how to reason about them. The course outline can be found here.
Prerequisites
- Discrete Structures (hard requirement); Automata and Computability (soft requirement -- meet me if you have questions!).
Reference Material
-
Elementary Net Systems (PDF),
Grzegorz Rozenberg and Joost Engelfriet,
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, Springer LNCS 1491 (1998) 12-121. -
Some Behavioural Aspects of Net Theory (PDF),
P.S. Thiagarajan,
Theoretical Computer Science, 71 (1990) 133-153. -
Place/Transition Nets (PDF),
Jörg Desel and Wolfgang Reisig,
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, Springer LNCS 1491 (1998) 122-173.
Topics covered
Date | Topics covered | |
---|---|---|
Jul 24 | Introduction, course outline (PDF). | |
Jul 27 | Basic definition of Petri nets, examples, dynamics, Token game, Elementary net systems, Place/transition nets, markings and reachability graph. ( reference A and B) |