A. I. Cuza University of Iaşi

Petri Nets and Applications

Course namePetri Nets and Applications CodeCS3210O2
Class Undergraduate, 2008 - 2011 Package 5
Level Licenţă Year 3 Semester 2 Status Optional
Hours per weekTotal hours per semesterTotal hours of individual workCreditsEvaluation typeTeaching language
CSLPr
2 0 2 0 48 94 5 E ro
Taught byAcademic and scientific title, name
Teaching Assistant, PhD, Oana Prisecaru
Required courses
ObjectivesAssimilating the basic notions about Petri nets and their different extensions. Acquiring analysis techniques for Petri nets. Understanding the practical applications of Petri nets in various areas. Achieving the ability to model and analyze real systems by using different types of Petri nets.
General thematicsP/T Petri nets. Properties and analysis methods for P/T nets. Subclasses of P/T nets. Extensions of P/T nets. Applications of P/T nets (modeling communication protocols, distributed algorithms). Extension of P/T Petri nets. Workflow theory: workflow nets, properties and extensions of workflow nets. High level Petri nets (Coloured Petri nets: properties, analysis methods and applications; nested Petri nets) Timed Petri nets. Applications of timed Petri nets.
Seminary / Laboratory thematicsP/T Petri nets. The modelling and analysis of real systems using P/T nets. The use of simulation and verification tools for P/T nets. Workflow nets. The use of specific tools for workflow nets. Coloured Petri nets. System modelling and analysis using coloured Petri nets. Case studies using CPNTools. Timed Petri nets. Other extensions of Petri nets.
Teaching methodsExposure using course notes (slides, available from the begining of each course) presented with a video-projector, demos on computer. Exposure (video-projector for the course), debate, exercises, problems, case studies (laboratory).
Bibliography• T. Jucan, F.L. Tiplea: Retele Petri. Teorie si Practica. Romanian Academy Press, Bucuresti, 1999.

• T. Murata. Petri nets: Properties, analysis and applications. Proc. of the IEEE 77(4), pp. 541-580, 1989.

• W. Reisig. Elements of Distributed Algorithms. Modeling and Analysis with Petri Nets, Springer-Verlag, 1998.

• K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Vol. 1, Basic Concepts. Monographs in Theoretical Computer Science, Springer-Verlag, 2nd corrected printing 1997. ISBN:3-540-60943-1.

• W.M.P. van der Aalst and K.M. van Hee. Workflow Management: Models, Methods, and Systems. MIT press, Cambridge, MA, 2004.

• Wil M. P. van der Aalst: Interval Timed Coloured Petri Nets and their Analysis. Application and Theory of Petri Nets 1993: 453-472.

EvaluationconditionsGrades for: the seminar and laboratory activity (LSA), two written tests (TS1,TS2) in week 8 and 15.
criteriasLSA >=5, TS1+TS2 >=8
modesThe seminar and laboratory activity (exercises, practical work, report) will be evaluated with a grade between 0 and 10. Each of the written tests (TS1, TS2) will be evaluated with a grade between 1 and 10.
formulaN= 40%LSA + 40%TS1 + 20%TS2 N is 4 if one of the required criteria is not met.

© 2006-2010 FII | about | intranet