|
|
|||||||||||||||||
Course Catalog 2011-2012
OHJ-2606 State Machines, 5 cr |
Additional information
The course is not organized but can be taken as a book examination.
Suitable for postgraduate studies
Will not be lectured year 2011-2012
Person responsible
Antti Valmari
Requirements
Weekly exercises, examination, or both. Please see the web page of the course. (The course is not organized this year but can be taken as a book examination.)
Completion parts must belong to the same implementation
Learning outcomes
State machines are found all over modern computer science. This course concentrates on the behaviour of state machines as seen by an external observer, and on interaction of state machines. The course is closely linked to recent research.
Content
| Content | Core content | Complementary knowledge | Specialist knowledge |
| 1. | Definition of state machines. State machines with and without local variables. Strong bisimilarity. | ||
| 2. | Building systems from state machines: parallel composition, hiding, relational renaming, other operators. | ||
| 3. | Abstraction to the externally observable behaviour of state machines. |
Study material
| Type | Name | Author | ISBN | URL | Edition, availability, ... | Examination material | Language |
| Lecture slides | State Machines | Antti Valmari | English |
Prerequisites
| Course | Mandatory/Advisable | Description |
| OHJ-2156 Analysis of Algorithms | Mandatory |
Prerequisite relations (Requires logging in to POP)
Correspondence of content
| Course | Corresponds course | Description |
|
|
|