Lectures:
- Introduction, elementary and general Petri nets, equivalent models, decision problems
- notatki z wykładu
- lecture notes
- J. Engelfriet, G. Rozenberg, Elementary Net Systems, sect. 3 (sect. 1 of Lectures on Petri Nets I: Basic Models)
- J. Desel, W.Reisig, Place/Transition Petri Nets, sect. 1-3 (sect. 2 of Lectures on Petri Nets I: Basic Models)
- Elementary nets: concurrency, dependence and conflict; regions - reconstruction from a finite automaton
- notatki z wykładu
- lecture notes
- J. Engelfriet, G. Rozenberg, Elementary Net Systems, sect. 3
- J. Desel, W. Reisig, The synthesis problem of Petri nets, sect. 1-5
- Mazurkiewicz traces - partially commutative languages, regular languages of traces
- notatki z wykładu
- lecture notes
- A. Mazurkiewicz, Introduction to Trace Theory
- Asynchronous automata recognize regular trace languages
- notatki z wykładu
- lecture notes
- M. Mukund, Automata on Distributed Alphabets
- V. Diekert, A. Muscholl, Construction of asynchronous automata, sect. 8.2
- Algorithmic analysis of Petri nets: coverability tree, universal lower bound
- lecture notes
- J. Desel, W.Reisig, Place/Transition Petri Nets, sect. 4
- J. Esparza, Decidability and complexity of Petri net problems — an introduction, part II, sect. 7
- Decidability of the reachability problem
- lecture notes
- S. Lasota, VASS reachability in three steps
- S. Kosaraju, Decidability of Reachability in vector addition systems
- Approximate analysis: invariants, continuous reachability
- lecture notes
- J. Esparza, Free Choice Petri Nets, sect. 2
- E. Fraca, S. Haddad, Complexity Analysis of Continuous Petri Nets
- Subclasses of Petri nets: free-choice nets
- lecture notes
- J. Esparza, Free Choice Petri Nets, sect. 3-4
- Distributed computing in Petri nets: population protocols
- lecture notes
- J. Esparza, Black Ninjas in the Dark: Formal Analysis of Population Protocols, sect. 1-3
- J. Esparza, P. Ganty, J. Leroux, R. Majumdar, Verification of population protocols, sect. 1-3, 8.5