FI:IA041 Concurrency Theory - Course Information
IA041 Concurrency TheoryFaculty of Informatics
- 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).
- 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
- 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 the course is directly associated with
- there are 48 fields of study the course is directly associated with, display
- Course objectives
- Students should study, understand, present and to work with the basic concepts and techniques used for modelling, analysis and verification of concurrent processes.
- Learning outcomes
- 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;
to make deductions based on acquired knowledge on actual topics and results of concurrent processes and their formal verification.
- 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.
- 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
- Further Comments
- The course is taught once in two years.
The course is taught: every week.
- Teacher's information