Babes-Bolyai University of Cluj-Napoca
Faculty of Mathematics and Computer Science
Study Cycle: Master
SUBJECT

Code	Subject	
MIC1002	Formal Methods of Concurrency and Communications	

Section	Semester	Hours: C+S+L	Category	Type	
Databases	3	2+1+1	speciality	compulsory	
Distributive Systems in Internet	3	2+1+1	speciality	compulsory	

Teaching Staff in Charge	Lect. STERCA Adrian Ioan, Ph.D., forest@cs.ubbcluj.ro
Prof. MUNTEAN Traian, Traian.Muntean@imag.fr	
Aims	The study of recent research in the field of concurrence and communications. The study of specifics related to the granularity demands of different concurrency models. Building specific concurrence-related projects and comparing their performance. The study of error and failure recovery.	
Content	1.The CCS Model - Calculus of Communication Systems (partea 1) [2] [4 chap 2]
2.The CCS Model - Calculus of Communication Systems (partea 2) [2] [4 chap 2]
3.The Pi-Calculus Model [4 chap 3]
4.Concurrency control - serialization, complexity, control, conflicts, algorithms [5 chap 3-5]
5.Object-oriented concurrency [5 chap 6-8]
6.Concurrency control in relational databases [5 chap 8]
7.Concurrency control in search structures: implementations and practical approaches [5 chap 9-10]
8.Failure models: transaction failure specifics and deadlock [5 chap 11-13]
9.Failure recovery in the paging, object, multimedia model [5 chap 14-16]
10.Concurrency control in distributed context: homogenous federations [5 chap 18]
11.Concurrency control in distributed context: heterogenous federations [5 chap 18]
12.Concurrency control in distributed context: deadlock in distributed systems: detection, recovery, prevention [5 chap 18]
13.The architecture of transputer machines [3]
14.Concurrence specific applications [1]
	
Bibliography	1.BOIAN F.M. FERDEAN C.M., BOIAN R.F., DRAGOS R.C. Programare concurentă pe platforme Unix, Windows, Java. Ed. Albastră, grupul Microinformatica, Cluj, 2002.
2.KOSKY A.S. Formal models for Concurrent Communication Systems. http://www.anthonykosky.com/pdf_files/WPE_91.pdf, 1991.
3.MUNTEAN T. Parallel Programming of Transputer Based Machine. IOS Press, 1992.
4.REICHEL H. Formal Models of Concurrency http://www.informatik.uni-bremen.de/~lschrode/teaching/Systems/ReichelCCS.pdf, 2003.
5.WEIKUM G. VOSSEN G. Transactional Information System: Theory, Algorithms, and Practice of Concurrency Control and Recovery. Kaufmann Morgan Publ. 2002.
	
Assessment	The didactic activity ends with a written exam (the W grade). During the semester, students will have to develop several projects and reports on concurrency and distributed systems communications related topics (the L grade).
Final grade = 50%W + 50%L.
All the requests related to the criteria which must be met by students in order to pass the exam (laboratory presence, minimal requests regarding the quality of reports/projects developed etc.) are at:
http://cs.ubbcluj.ro/~forest/mfcc