Models of Parallelism and Concurrency Using Petri Nets |
ter |
||||
Teaching Staff in Charge |
Assoc.Prof. TOADERE Teodor, Ph.D., toaderecs.ubbcluj.ro |
Aims |
Acquiring practical tools (models and algorithms) to be used by computer scientists for solving problems (paralelism, concurency, hunger) in the field of distributed programming. Knowledge of useful ways in modelling the practical transitional distributed systems. |
References |
1. Colectia Lecture Notes in Computer Science, 1978-1994.
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. |
Assessment |
During the semester the students will present scientific reports. At the end of the semester each student will present a more detailed research study based on one of the subjects discussed at the course. |
Links: | Syllabus for all subjects Romanian version for this subject Rtf format for this subject |