Petri nets 1000-2M01SP

1. Elementary Nets.
2. Reachability graph.
3. Place-transition nets. Petri nets properties: reachability, liveness, boundedness
4. Incidence matrix and the state equation. .
5. Coverability graph.
6. Cycles. P-systems, T-systems
7. Free-choice Petri nets
8. Extensions of Petri Nets: inhibitor arcs, priorities, self-modifying nets
9. Petri net computers. Functions computable by Petri nets. Decidability and complexity.
10.Coloured Petri nets

The course will be given in Polish, if no non-polish speaking students register for it.

Course coordinators

Karol Zygmont

Type of course

elective monographs

Mode

Classroom

Prerequisites (description)

(in Polish) Zakładana jest znajomość algebry liniowej w zakresie przestrzeni i podprzestrzeni liniowych, rozwiązywania układów równań liniowych.

Learning outcomes

Students learn techniques for design and analysis of asynchronous concurrent systems, with particular emphasis on business processes. They are able to use mathematical methods to analyze systems (K_W02, K_U01). They are able to resolve problems of non-blocking, boundedness and liveness of soncurren systems (K_U07). They acquire knowledge about reachability problems in systems with an exponential explosion of the number of states.

Assessment criteria

During the workshops associated with the lecture students solve a series of homework assignments. Final mark proposal is based on the individual activity during the workshops supported by an adequate number of solved homework tasks. The exam consists of a written solution of a set of tasks covering the material. Tasks are assessed on a scale 0-4. The threshold is 50%

Bibliography

1.W.Reisig, Petri Nets, Springer Verlag 1987