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, e.g., CS207 or equivalent (hard requirement, mandatory) and Automata theory (soft requirement, recommended but not mandatory)
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. -
Structure theory of Petri nets: the free choice hiatus (PDF),
E. Best,
Advances in Petri nets 1986-87, part 1 on Petri nets , Springer LNCS 254 168-205.
Topics covered
Date | Topics covered | |
---|---|---|
Jul 30 | Introduction, course outline (PDF). | |
Aug 02 | Petri nets, basic definitions, examples, dynamics of a net, token game, elementary net systems, place/transition nets. ( reference A and C) | |
Aug 06 | Dynamics as a transition system: the reachability graph, Fundamental situations: Concurrency, Conflict, Causality, Contact, Confusion. ( reference A, B and C) | |
Aug 09 | Confusion-free subclasses of nets: S-systems, T-systems, simple and extended free-choice nets. Behavioral theory of ENS: firing sequences and traces ( reference D and B) |