The questions for the exam will be chosen from the following topics:

• P/T nets, definitions and notation
• Notions of conflict, concurrency and confusion
• Pr/T Nets, definitions and notation
• Construction of reachability graphs (P/T and Pr/T net case)
• Algorithm for the construction of reachability graph
• Construction of coverability graphs (P/T and Pr/T net case)
• Algorithm for the construction of the coverability graph
• Place invariants, C-matrix, review your linear algebra!!
• Stochastics Petri Nets. Basic notions of how to solve the steady state vector
• The idea behind Symmetry method in the fight against state space explosion, as well as the idea behind the Stubborn set method
• LTL formulae, the operators box, diamond, until, etc.
• Process algebras, syntax, expansion principle, observational equivalences - definition, bisimulation - definition,
• Maria syntax
• Basic SDL (states, inputs, outputs, tasks)
• Translation to/from Maria, Pr/T nets, Process Algebras