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.
Type of course
Mode
Prerequisites (description)
Course coordinators
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
Additional information
Information on level of this course, year of study and semester when the course unit is delivered, types and amount of class hours - can be found in course structure diagrams of apropriate study programmes. This course is related to the following study programmes:
- Bachelor's degree, first cycle programme, Computer Science
- Master's degree, second cycle programme, Computer Science
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: