FI:IA041 Concurrency Theory - Course Information

IA041 Concurrency Theory

Extent and Intensity

0/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: zk (examination), z (credit).

Teacher(s)

prof. RNDr. Mojmír Křetínský, CSc. (lecturer)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics

Timetable

Tue 10:00–11:50 B011

Prerequisites (in Czech)

! I041 Concurrency Theory && IA006 Automata

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

• Applied Informatics (programme FI, N-AP)
• Informatics (programme FI, M-IN)
• Informatics (programme FI, N-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
• Upper Secondary School Teacher Training in Informatics (programme FI, N-SS)

Course objectives

This seminar is open to active participants only. Every participant is expected to study and give a talk on one or two journal/conference papers or subchapter of a book/monograph. These will be specified by a person in charge of running seminar. The number of participants is limited.

Syllabus

• Processes, labelled transition systems and their (finite) specifications. Operational semantics. Caucal a Mayr hierarchies.
• Selected sematic equivalencies (and preorders) for processes and their relationships (linear time - branching time spectrum).
• Boundaries of algorithmic verification (equivalence checking) -- undecidability, decidability and complexity of some semantic equivalencies on selected classes of infinite state processes.

Literature

• BAETEN, J.C.M. and W.P. WEIJLAND. Process Algebra. Cambridge: Cambridge University Press, 1990, 248pp. Cambridge Tracts in Theoret.Computer Science. ISBN 0-521-40043-0. info
• Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
• BURKART, Olaf. Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997, 163 s. ISBN 3540639829. info
• Články z časopisů a sborníků konferencí, dle specifikace vyučujícího

Assessment methods (in Czech)

viz anotace

Language of instruction

Czech

Further Comments

The course is taught once in two years.

Teacher's information

http://www.fi.muni.cz/usr/kretinsky/

• Enrolment Statistics (Spring 2006, recent)
  
• Permalink: https://is.muni.cz/course/fi/spring2006/IA041