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: 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
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Mon 14:00–15:50 B411

Prerequisites

IA006 Automata theory
Knowlegde corresponding to the courses IA006 - Automata IB107 - Computability and complexity

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 20 student(s).
Current registration and enrolment status: enrolled: 0/20, only registered: 0/20, only registered with preference (fields directly associated with the programme): 0/20

fields of study / plans the course is directly associated with

• Applied Informatics (programme FI, N-AP)
• Information Technology Security (programme FI, N-IN)
• Bioinformatics (programme FI, N-AP)
• Information Systems (programme FI, N-IN)
• Parallel and Distributed Systems (programme FI, N-IN)
• Computer Graphics (programme FI, N-IN)
• Computer Networks and Communication (programme FI, N-IN)
• Computer Systems (programme FI, N-IN)
• Embedded Systems (eng.) (programme FI, N-IN)
• Embedded Systems (programme FI, N-IN)
• Service Science, Management and Engineering (eng.) (programme FI, N-AP)
• Service Science, Management and Engineering (programme FI, N-AP)
• Social Informatics (programme FI, B-AP)
• Theoretical Informatics (programme FI, N-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, N-SS) (2)
• Artificial Intelligence and Natural Language Processing (programme FI, N-IN)
• Image Processing (programme FI, N-AP)

Course objectives

At the end of the course students should be able to understand and to work with the basic techniques used for modelling, analysis and verification of concurrent processes. Students should be able make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.

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

Teaching methods

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. Each talk will be followed by class discussion, The number of participants is limited.

Assessment methods

seminars, active participation (giving talks, discussions)

Language of instruction

Czech

Further Comments

Study Materials
The course is taught once in two years.

Teacher's information

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

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