|
|
|||||||||||||||||
Course Catalog 2013-2014
MAT-74006 Concurrency Theory, 7 cr |
Additional information
The course is given every second year. The homepage of the course is http://www.cs.tut.fi/~ava/conctheory.html
Suitable for postgraduate studies
Person responsible
Antti Valmari
Lessons
| Study type | P1 | P2 | P3 | P4 | Summer | Implementations | Lecture times and places |
|
|
|
|
|
|
|
|
|
Requirements
If the number of students is small, the course is passed by solving many enough weekly exercise problems. Otherwise there will be an examination.
Completion parts must belong to the same implementation
Learning Outcomes
The student can read scientific literature on process algebras. (S)he knows one theory of reactive concurrent systems that supports full abstraction a.k.a. externally observable behaviour and has an idea of how other theories differ.
Content
| Content | Core content | Complementary knowledge | Specialist knowledge |
| 1. | Modelling systems as co-operating state machines (labelled transition systems) with variables. | Process-algebraic languages such as Lotos, CSP and CCS. | |
| 2. | Bisimulation and bisimilarity. | Algorithms for bisimilarity. | |
| 3. | Unfolding. | ||
| 4. | Trace semantics and CFFD-semantics: equivalence and preorder. | Branching bisimilarity, observation equivalence, CSP-semantics. | Weakest congruence results. Non-existence results. |
| 5. | Verification algorithms and techniques. | Computational complexity of verification. |
Study material
| Type | Name | Author | ISBN | URL | Edition, availability, ... | Examination material | Language |
| Other literature | Composition and Abstraction | Antti Valmari | Yes | English | |||
| Other literature | External Behaviour of Systems of State Machines with Variables | Antti Valmari | Yes | English | |||
| Other literature | Scientific papers in the field | Will be delivered to the students. | No | English |
Prerequisites
| Course | Mandatory/Advisable | Description |
| MAT-02650 Mathematics for Algorithms | Mandatory | |
| MAT-71000 Introduction to Information and Computation | Advisable | |
| TIE-02100 Introduction to programming | Mandatory |
Prerequisite relations (Requires logging in to POP)
Correspondence of content
There is no equivalence with any other courses
More precise information per implementation
| Implementation | Description | Methods of instruction | Implementation |