FI:I041 Concurrency Theory - Course Information
I041 Concurrency Theory
Faculty of InformaticsSpring 2002
- 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
Contact Person: prof. RNDr. Mojmír Křetínský, CSc. - Timetable
- Thu 15:00–16:50 B411
- Prerequisites
- I005 Formal Languages and Automata I && I006 Automata II && I010 Communication and Parallelism && M006 Set Theory && M009 Algebra II
Prerequisites: I010 Communication and Parallelism. I005 Formal Languages and Automata I, I006 Formal Languages and Automata II, M006 Set Theory, M009 Algebra II - 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
- Informatics (programme FI, B-IN)
- Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Information Technology (programme FI, B-IN)
- Syllabus
- 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.
- Models of processes, process specification: selected process calculi/algebras, operational semantics, (un)decidability of some sematic equivalencies.
- Examples of process specification.
- Selected sematic equivalencies for processes and their relationship
- Boundaries of algorithmic verification - (un)decidability of some semantic equivalencies on some process subclasses.
- 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
- 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
- Language of instruction
- Czech
- Further Comments
- The course is taught once in two years.
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/spring2002/I041