Lectures Plan

Semantics & Verification, Spring 2008

---

Semester calendar for the course is available here.

• Lecture 1 (5.2.2008, 10.00-12.00, 0.2.13): 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: pages 1-6; Chapter 2 (Section 2.1): pages 7-16; Chapter 2 (subSection 2.2.1): pages 17-21).
  • Tutorial: there is no tutorial this time.
  
  
  
• Lecture 2 (6.2.2008, 14.30-16.15, 0.2.13): 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 (Section 2.2): pages 21-27)
  • Tutorial:
    • 12:30-14:15 in 0.2.13
    • [Exercise Set 1] [Solutions]
  
  
  
• Lecture 3 (12.2.2008, 10.15-12.00, 0.2.13): 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 31-53)
    • Reactive Systems: Modelling, Specificaton and Verification (Chapter 3 (Section 3.5): pages 65-70)
  • Tutorial:
    • 8:15-10:00 in 0.2.13
    • [Exercise Set 2] [Solutions]
  
  
  
• Lecture 4 (14.2.2008, 14.30-16.15, 0.2.13): 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 53-65)
    • Reactive Systems: Modelling, Specificaton and Verification (Chapter 3 (Section 3.5.1): pages 70-72)
    • Reactive Systems: Modelling, Specificaton and Verification (Chapter 3 (Section 3.6): pages 72-74)
  • Tutorial:
    • 12:30-14:15 in 0.2.13
    • [Exercise Set 3] [Solutions]
  
  
  
• Lecture 5 (26.2.2008, 10.15-12.00, 0.2.13): 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 5: pages 89-101)
  • Tutorial:
    • 8:15-10:00 in 0.2.13
    • [Exercise Set 4] [Solutions]
  
  
  
• Lecture 6 (28.2.2008, 14.30-16.15, 0.2.13): 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 6 (introduction and Section 6.1: pages 102-109)
    • Reactive Systems: Modelling, Specificaton and Verification (Chapter 4 (Sections 4.1 and 4.2: pages 75 to 88).
  • Tutorial:
    • 12:30-14:15 in 0.2.13
    • [Exercise Set 5] [Solutions]
  
  
  
• Lecture 7 (4.3.2008, 10.15-12.00, 0.2.13): 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 (Section 4.3: pages 85-88)
    • Reactive Systems: Modelling, Specificaton and Verification (Sections 6.2, 6.3, 6.4, 6.8: pages 109-120, 139-141)
    • Reactive Systems: Modelling, Specificaton and Verification (Sections 6.5, 6.6, 6.7: pages 120-138; this is not a mandatory reading)
  • Tutorial:
    • 8:15-10:00 in 0.2.13
    • [Exercise Set 6] [Solutions]
  
  
  

  ---

• Lecture 8 (6.3.2008, 12.30-16.15, 0.2.13): 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 the whole afternoon to assist you; make sure that you have one laptop for each working group (2-3 students) and that you are able to run CWB.
  • Reading (see the online material):
    • A short introduction to the Concurrency Workbench (or the danish version).
    • The Edinburgh Concurrency Workbench (Version 7.1).
  
  
  
• Tutorial (11.3.2008, 8.15-10.00, 0.2.13): Finalization of the mini project. The tutorial is supervised.
  
  
  
  
• Lectures 9-15 are here.