Semantics & Verification, Spring 2005

Lectures Plan

Semantics & Verification, Spring 2005

Semester calendar for the course is here.

Lecture 1 (2.2.2005, 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:
  - A Note on Game Characterization of Strong and Weak Bisimilarity (sections 1 and 2).
  - An Introduction to Milner's CCS (pages 1 to 10).
  - System Verification (chapter 1).
- Tutorial: there are no tutorials.
Lecture 2 (7.2.2005, 14.30-16.15, B3-104): CCS [slides] [slides 3x2] [print-friendly 3x2]
- Plan: CCS informally (continuation); formal definition of CCS; semantics of CCS; examples.
- Reading:
  - An Introduction to Milner's CCS (pages 10 to 26).
- Tutorial:
  - 12:30-14:15; Group 1 in NJ14 3-119; Group 2 in NJ14 4-117 (the building of NOVI)
  - [Exercise Set 1] [Solutions]
Lecture 3 (9.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:
  - A Note on Game Characterization of Strong and Weak Bisimilarity (section 3).
  - An Introduction to Milner's CCS (pages 23 to 42 but pages 23 to 26 on value passing CCS are optional).
- Tutorial:
  - 8:15-10:00; both Group 1 and Group 2 in B3-104
  - [Exercise Set 2] [Solutions]
Lecture 4 (14.2.2005, 14.30-16.15, 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:
  - A Note on Game Characterization of Strong and Weak Bisimilarity (section 4).
  - An Introduction to Milner's CCS (pages 43 to 50).
- Tutorial:
  - 12:30-14:15; Group 1 in E3-109 and Group 2 in E3-209
  - [Exercise Set 3] [Solutions]
Lecture 5 (16.2.2005, 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:
  - An Introduction to Milner's CCS (chapter 6).
- Tutorial:
  - 8:15-10:00; both Group 1 and Group 2 in B3-104
  - [Exercise Set 4] [Solutions]
Lecture 6 (2.3.2005, 10.15-12.00, FIB15 aud. C): 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:
  - An Introduction to Milner's CCS (pages 60 to 64).
  - An Introduction to Milner's CCS (appendix A.1 and A.2, pages 86 to 93).
- Tutorial:
  - 8:15-10:00; Group 1 in E3-109 and Group 2 in E3-209
  - [Exercise Set 5] [Solutions]
Lecture 7 (7.3.2005, 14.30-16.15, 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:
  - An Introduction to Milner's CCS (appendix A.3, pages 93 to 95).
  - An Introduction to Milner's CCS (pages 64 to 71).
  - Game Characterization of Hennessy-Milner Logic with One Recursively Defined Variable (see the online material).
  - An Introduction to Milner's CCS (pages 77 to 86; this is not a mandatory reading).
- Tutorial:
  - 12:30-14:15; Group 1 in E3-109 and Group 2 in E3-209
  - [Exercise Set 6] [Solutions]
Lecture 8 (9.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 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).
Lecture 9 (4.4.2005, 14.30-16.15, B3-104): Introduction to Timed Automata [slides] [slides 3x2] [print-friendly 3x2]
- Plan: Labelled transition systems with time; timed automata; timed (untimed) trace equivalence and timed (untimed) bisimilarity.
- Reading:
  - Timed Automata: Semantics, Algorithms and Tools (sections 1 and 2) - this is a new material (not included in the compendium) and it is available from here
  - Model Checking Real-Time Logics (sections 4.1 and 4.2)
- Tutorial:
  - 12:30-14:15; Group 1 in E3-109 and Group 2 in E3-209
  - finishing the work on the first mini project and writing down the report (tutorials will be supervised as usual); you can also start solving the first exercise of Tutorial 9 if time allows.
Lecture 10 (6.4.2005, 10.15-12.00, FIB15 aud. C): Region/Zone Graphs and Networks of Timed Automata [slides] [slides 3x2] [print-friendly 3x2]
- Plan: Regions and zones; reachability in timed automata; networks of timed automata; logics.
- Reading:
  - Timed Automata: Semantics, Algorithms and Tools (sections 3.1, 5.2 and the part about networks of timed automata in section 5.1)
  - Model Checking Real-Time Logics (section 4.6 - ignore the parts about TCTL)
- Tutorial:
  - 8:15-10:00; Group 1 in E3-109 and Group 2 in E3-209
  - [Exercise Set 9] [Solutions]
Lecture 11 (14.4.2005, 10.15-12.00, FIB15 aud. C): Timed Automata and UPPAAL [slides] [slides 3x2]
- Plan: Introduction to UPPAAL; practical examples of verification. The lecture will be given by a guest lecturer Gerd Behrmann.
- Reading:
  - UPPAAL in a Nutshell or A Tutorial on UPPAAL according to your choice
- Tutorial:
  - 8:15-10:00; both Group 1 and and Group 2 in FIB15 aud. C
  - [Exercise Set 10] [Solutions]
Lecture 12 (15.4.2005, 8.15-12.00, B3-104): Mini Project: Gossiping Girls in UPPAAL
- Plan: to solve in groups the mini project (the description is here); we will be available in the lecture room the whole morning to assist you; make sure that you have one laptop for each working group and that you are able to run UPPAAL.
- Reading:
  - UPPAAL in a Nutshell or A Tutorial on UPPAAL according to your choice
Lecture 13 (21.4.2005, 10.15-12.00, FIB15 aud. C): Binary Decision Diagrams (BDD) [slides] [slides 3x2] [print-friendly 3x2]
- Plan: Boolean expressions; normal forms; Shannon's expansion law; ordered and reduced binary decision diagrams; canonicity lemma; algorithms for manipulating BDDs.
- Reading:
  - An Introduction to Binary Decision Diagrams (pages 6 to 27)
- Tutorial:
  - 8:15-10:00; Group 1 in E3-109 and Group 2 in E3-209
  - finishing the work on the second mini project and writing down the report (tutorials will be supervised as usual).
Lecture 14 (25.4.2005, 14.30-16.15, B3-104): BDDs and Verification [slides] [slides 3x2]
- Plan: Constraint solving problems; encoding transition systems and bisimulation; tools. The lecture will be given by a guest lecturer Kim Guldstrand Larsen.
- Reading:
  - An Introduction to Binary Decision Diagrams (pages 27 to 34)
  - Practical Verification of Embedded Software
  - A SAT Solver Primer (optional, but very interesting reading)
- Tutorial:
  - 12:30-14:15; both Group 1 and and Group 2 in B3-104
  - [Exercise Set 13] [Solutions]
Lecture 15 (27.4.2005, 10.15-12.00, B3-104): Round-up of the Course [slides] [slides 3x2] [print-friendly 3x2]
- Plan: Overview of key topics of the course; information about the exam and its form; selection of star exercises; evaluation of the course.
- Tutorial:
  - 8:15-10:00; both Group 1 and Group 2 in B3-104
  - Remember to bring one laptop per each group, we will be experimenting with the tool Iben. Some information about the tool and a link to a very short tutorial is on the news page.
  - [Exercise Set 14] [Solution of Ex.1, Solution of Ex.2]

The course is over now.