Universitatea Babeş-Bolyai Cluj-Napoca
Facultatea de Matematică şi Informatică
Ciclul de studii: Masterat
Domeniul: Informatica
Programul de studii: Programare bazată pe componente - în limba engleză
Limba de predare: Engleză

SYLLABUS

I. General data
Code	Subject	
MID1011	Petri Nets in Software Modeling and Verification	

Semester	Hours: C+S+L	Category	Status	
4	2+2+0	speciality	compulsory	

II. Full status faculty members
Name and	Scientific	Didactic	Chair	Type of activity	
surname	title	title		C	S	L	
TOADERE Teodor	Ph.D.	Assoc.Prof.	Computer Systems	*			

Associated faculty members
Name and	Scientific	Institution	Type of	Type of activity	
surname	title		position	C	S	L	

III. Course objectives
Dobandirea de instrumente practice (modele si algoritmi) cu ajutorul carora informaticianul rezolva probleme (paralelism, concurenta, infometare) din domeniul programarii multitasking. Cunoasterea unui mod util in practica pentru modelarea sistemelor tranzitionale distribuite din practica	

IV. Course contents
Sisteme tranzitionale distribuite. Axiomele A1-A5. Sisteme retea.
Reteua Petri (PTN) ca mijloc de modelare;
Retele Petri(PTN) Conditie/Eveniment si Locatie/Tranzitie;
Reprezentarea PTN (geometric, matriceal);
Evolutia unei PTN (secventiala, concurenta);
Modelul producator-consumator;
Analiza PTN cu ajutorul algebrei liniare;
Modelul expeditor –destinatar;
Modelul citire –scriere intr-un buffer comun;
Proprietati: comutativitate, monotonie; vivacitate, accesibilitate, terminare finita; echitate;
Graf si arbore de acoperire;
Graf si arbore de accesibilitate;
Probleme de decizie;
PTN controlate;
PTN normate;
Zavoare si trape;
Retele cu alegere libera;	

V. Bibliography
1. Colectia Lecture Notes in Computer Science, 1978-
2. GUY VIDAL-NAQUET, ANNI CHOQUET-GENIET, Reseaux de Petri et Systemes Paralleles, Armond Colin, 1992.
3. WOLFGANG REISIG, Petri Nets, An Introduction; Springer-Verlag; Berlin, Heidelberg, New-York, Tokyo; 1985.
4. T. JUCAN, F. L. TIPLEA, Retele Petri, Ed. Univ. "Al.I.Cuza", Iasi, 1995.
 5. T. JUCAN, F. L. TIPLEA, Retele Petri. Teorie şi Practica, Ed. Academiei, 1999.	

VI. Thematic of didactic activities per weeks
Conform cu continutul cursului (vezi punctul IV)	

VII. Didactic methods used
Expositions: description, explanation, class lectures, dialog-based lectures, introductive lectures, current lectures, synthesis lectures. 
Conversations: debate, dialog, introductive conversations, conversations for knowledge consolidation, conversations to systematize and synthesize knowledge 
Use of problems: use of problem questions, problems and problem situations. 
Discovery: directed and independent rediscovery, creative discovery, inductive discovery, deductive discovery, experimental discovery. 
Other methods: case study; cooperation, brainstorming, individual study, exercise, homework study.	

VIII. Assessment
The activity ends with a written final exam. During the semester, the students will have to prepare a theoretical report and a software project in the topic. Optionally, the students can design an illustrative example for a course concept. 
Final grade consists from:
•	Final writtenexam:                                      30%
•	The quality of the project                           30%
•	Technical report :                                       25% 
•	A representativ example presentation :      15%

IX. Additional references
Orice text tipografic sau electronic din tematică	

	Date,							Course responsible,
						Assoc.Prof. TOADERE Teodor, Ph.D.