FI:IA072 Seminar on Concurrency - Course Information
IA072 Seminar on Concurrency
Faculty of InformaticsAutumn 2013
- 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)
prof. RNDr. Jan Strejček, Ph.D. (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.
Supplier department: Department of Computer Science – Faculty of Informatics - Timetable of Seminar Groups
- IA072/01: Fri 10:00–11:50 B411, M. Křetínský, J. Strejček
- Prerequisites
- SOUHLAS
for postgraduate students; undergraduate students may ask for an exception, especially if they successfully passed IA040 Modal and Temporal Logics for Processes and IA041 Concurrency Theory and want to work in the area of concurrent processes, formal verification, or program analysis. - 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
- there are 26 fields of study the course is directly associated with, display
- Course objectives
- At the end of the course students should be able to:
understand a theoretical scientific text;
make a presentation that explains main ideas of such a text;
apply information on current topics (and results) of concurrency and formal verification research areas in an eventual original research; - Syllabus
- Presentations of (preferably original) results from the following areas:
- Process algebras and their specifications.
- Infinite state systems and their hierachies.
- Semantic equivalences and preorders.
- Decidability and complexity of verification problems.
- Analysis, validation, and verification of software.
- Literature
- Handbook of process algebra. Edited by J. A. Bergstra - A. Ponse - Scott A. Smolka. Amsterdam: Elsevier, 2001, xiv, 1342. ISBN 0444828303. info
- Journal and conference papers specified by a person in charge of running seminar.
- Teaching methods
- seminar; every participant is expected to give a talk on a journal/conference paper (these will be specified by a person in charge of running seminar); presentations of new original results are preferred.
- Assessment methods
- presentations, attendance at seminars
- Language of instruction
- English
- Further comments (probably available only in Czech)
- Study Materials
The course is taught each semester.
- Enrolment Statistics (Autumn 2013, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2013/IA072