Petri nets
General data
| Course ID: | 1000-2M01SP |
| Erasmus code / ISCED: |
11.303
|
| Course title: | Petri nets |
| Name in Polish: | Sieci Petriego |
| Organizational unit: | Faculty of Mathematics, Informatics, and Mechanics |
| Course groups: |
(in Polish) Przedmioty obieralne na studiach drugiego stopnia na kierunku bioinformatyka Elective courses for Computer Science and Machine Learning |
| ECTS credit allocation (and other scores): |
6.00
|
| Language: | English |
| Type of course: | elective monographs |
| Prerequisites (description): | (in Polish) Zakładana jest znajomość algebry liniowej w zakresie przestrzeni i podprzestrzeni liniowych, rozwiązywania układów równań liniowych. |
| Mode: | Classroom |
| Short description: |
Petri nets are probably the most successful model for concurrency. It combines two features: simplicity of presentation together with advanced analysis techniques. Rich literature is availabe, and many tools that support the use of Petri nets in commercial and scientific areas. Necessary for everyone who would like to understand the coordination of cooperating parallel processes. |
| Full description: |
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. |
| Bibliography: |
1.W.Reisig, Petri Nets, Springer Verlag 1987 |
| 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 methods and 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% |
Classes in period "Summer semester 2024/25" (past)
| Time span: | 2025-02-17 - 2025-06-08 |
Go to timetable
MO TU W WYK
CW
TH FR |
| Type of class: |
Classes, 30 hours
Lecture, 30 hours
|
|
| Coordinators: | Piotr Chrząstowski-Wachtel | |
| Group instructors: | Piotr Chrząstowski-Wachtel | |
| Students list: | (inaccessible to you) | |
| Credit: | Examination |
Copyright by University of Warsaw.
