FI:IA072 Concurrency - Course Information
IA072 Concurrency Club
Faculty of InformaticsSpring 2006
- Extent and Intensity
- 2/0. 3 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
Contact Person: prof. RNDr. Mojmír Křetínský, CSc. - Timetable
- Fri 10:00–11:50 B411
- Prerequisites
- SOUHLAS
for postgraduate students; undergraduate students may ask for an exception, especially if they successfully passed I040 Modal and Temporal Logics for Processes and I041 Concurrency Theory and want to work in the area of concurrent processes. - 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 15 student(s).
Current registration and enrolment status: enrolled: 0/15, only registered: 0/15, only registered with preference (fields directly associated with the programme): 0/15 - fields of study / plans the course is directly associated with
- Applied Informatics (programme FI, N-AP)
- Informatics (programme FI, D-IN)
- 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 give a talk on a journal/conference paper or a subchapter of a book/monograph (these will be specified by a person in charge of running seminar). Presentations of new original results is preferable.
- Syllabus
- Presentations of new original results is preferable.
- Process algebras and their specifications
- Infinite state systems and their hierachies
- Semantic equivalences and preorders
- Decidability and undecidability. Complexity of decidable problems.
- Literature
- Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
- Články z časopisů a sborníků konferencí, dle specifikace vedoucího semináře
- Assessment methods (in Czech)
- viz anotace a osnova
- Language of instruction
- Czech
- Further comments (probably available only in Czech)
- The course is taught each semester.
Information on course enrolment limitations: předmět určen pro PGS, studenti mag.studia mohou požádat o výjimku - Teacher's information
- http://www.fi.muni.cz/usr/kretinsky/
- Enrolment Statistics (Spring 2006, recent)
- Permalink: https://is.muni.cz/course/fi/spring2006/IA072