Communication with Automata

From International Center for Computational Logic

Communication with Automata

Talk by Stephan Mennicke
In this talk I will give an overview on the basic notions of Petri nets, in order to derive two results and their proofs. The selection of the particular results is (1) a personal choice (because I like them) and (2) taught in the course "Models of Concurrent Systems" (apparently also known as "Concurrency Theory") this semester.

The talk is online,

Link: https://bbb.tu-dresden.de/b/ali-zgz-l8d-52n