Lectures Plan
Semantics & Verification, Spring 2006
Semester calendar for the course is
here.
- Lecture 1 (3.2.2006, 10.15-12.00, B3-104):
Labelled Transition Systems
[slides]
[slides 3x2]
[print-friendly 3x2]
- Plan: Introduction; reactive systems;
labelled transition systems; binary relations; CCS informally.
- Reading:
- Reactive Systems: Modelling, Specificaton and Verification
(Chapter 1 (section 1.1): pages 3-8; Chapter 2 (section 2.1): pages 9-12;
Chapter 2 (section 2.2): pages 20-24).
- Additional recommended reading: System Verification (chapter 1).
- Tutorial: there are no tutorials this time.
- Lecture 2 (8.2.2006, 10.15-12.00, B3-104):
CCS
[slides]
[slides 3x2]
[print-friendly 3x2]
- Plan:
CCS informally (continuation);
formal definition of CCS; semantics of CCS; examples.
- Reading:
- Reactive Systems: Modelling, Specificaton and Verification
(Chapter 2 (sections 2.1 and 2.2): pages 12-33)
- Tutorial:
- Lecture 3 (10.2.2005, 10.15-12.00, B3-104):
Strong Bisimilarity
[slides]
[slides 3x2]
[print-friendly 3x2]
- Plan:
Value passing CCS; trace equivalence; strong bisimilarity; bisimulation
games; properties of strong bisimilarity.
- Reading:
- Reactive Systems: Modelling, Specificaton and Verification
(Chapter 3 (sections 3.1, 3.2 and 3.3): pages 35-54)
- Reactive Systems: Modelling, Specificaton and Verification
(Chapter 3 (section 3.5): pages 63-67)
- Tutorial:
- Lecture 4 (17.2.2005, 10.15-12.00, B3-104):
Weak Bisimilarity
[slides]
[slides 3x2]
[print-friendly 3x2]
[protocol.cwb]
- Plan:
Properties of strong bisimilarity; weak bisimilarity; weak bisimulation games;
properties of weak bisimilarity; example (a tiny communication protocol).
- Reading:
- Reactive Systems: Modelling, Specificaton and Verification
(Chapter 3 (section 3.4): pages 55-63)
- Reactive Systems: Modelling, Specificaton and Verification
(Chapter 3 (section 3.5): pages 67-69)
- Tutorial:
- Lecture 5 (22.2.2006, 10.15-12.00, B3-104): Hennessy-Milner Logic
[slides]
[slides 3x2]
[print-friendly 3x2]
[hm.cwb]
- Plan:
Motivation; syntax of Hennessy-Milner logic; semantics of Hennessy-Miler
logic; examples in CWB; correspondence between strong bisimilarity and
Hennessy-Milner logic.
- Reading:
- Reactive Systems: Modelling, Specificaton and Verification
(Chapter 4: pages 73-82)
- Tutorial:
- Lecture 6 (24.2.2006, 10.15-12.00, B3-104):
Tarski's Fixed Point Theorem
[slides]
[slides 3x2]
[print-friendly 3x2]
- Plan: Hennessy-Milner logic and temporal properties;
complete lattices; Tarski's fixed point theorem; computing fixed points
in finite lattices.
- Reading:
- Reactive Systems: Modelling, Specificaton and Verification
(Chapter 5: pages 83-89)
- Reactive Systems: Modelling, Specificaton and Verification
(appendix A.1 and A.2, pages 223 to 229).
- Tutorial:
- Lecture 7 (3.4.2006, 10.15-12.00, B3-104):
Hennessy-Milner Logic with Recursion
[slides]
[slides 3x2]
[print-friendly 3x2]
- Plan:
Bisimulation as a fixed point; one recursively defined variable in
Hennessy-Milner logic; game characterization; more recursively defined
variables; characteristic properties.
- Reading:
- Reactive Systems: Modelling, Specificaton and Verification
(appendix A.3: pages 230-231)
- Reactive Systems: Modelling, Specificaton and Verification
(Sections 5.1, 5.2, 5.3, 5.4, 5.5: pages 87-100)
- Reactive Systems: Modelling, Specificaton and Verification
(Sections 5.7: pages 106-113; this is not a mandatory reading)
- Tutorial:
- Lecture 8 (8.3.2005, 8.15-12.00, B3-104):
Mini Project: Verification of Alternating Bit Protocol in CWB
- Plan: to solve in groups the mini project (the description
is here); we will be available in the lecture room
and in the canteen area
the whole morning to assist you; make sure that you have
one laptop for
each working group and that you are able to run CWB.
- Reading:
- A short introduction to the Concurrency Workbench (or the danish
version).
- The Edinburgh Concurrency Workbench (Version 7.1).
- Lectures 9-15 are here.