This is the home page for the Fall
2016 semester Logical Foundations of Computer Science course taught by Peter
Fejer. Check here often for course information and homework assignments.
Note: Most of the material in the slides comes from a set of slides by Joost-Pieter Katoen. These slides are used with permission.
This is an approximate syllabus, and is subject to change.
Date
|
Topic
|
Textbook
Section(s)
|
Slides
|
Homework
|
Sep
7
|
Introduction
|
Chapter 1
|
PDF
|
|
Sep
12
|
Transition Systems
|
Section 2.1
|
PDF
|
|
Sep
14
|
Parallelism and Communication I
|
Subsections 2.2.1 to 2.2.3
|
PDF
|
|
Sep
19
|
Parallelism and Communication
II
|
Subsections 2.2.4, 2.2.6
Section 2.3
|
PDF
|
|
Sep
21
|
Linear Time Properties I –
Definition and Invariant Properties
|
Section 3.1 (not covered in
class) Section 3.2 Subsection 3.3.1
|
PDF
|
|
Sep
26
|
Linear Time Properties II –
Safety Properties
|
Subsections 3.3.2, 3.3.3
|
PDF
|
|
Sep
28
|
Linear Time Properties III –
Liveness Properties and Fairness
|
Sections 3.4, 3.5
|
PDF
|
|
Oct
3
|
Linear Time Properties IV –
Fairness
Regular Safety Properties I
|
Section 3.5
Section 4.1
|
See Sep 28
PDF
|
|
Oct
5
|
Regular Safety Properties II
Automata on Infinite Words I
|
Sections 4.1, 4.2
Subsection 4.3.1
|
See Oct 3
PDF
|
|
Oct
10
|
Columbus Day
|
|
|
|
Oct
12
|
Automata on Infinite Words II
|
Subsection 4.3.2
|
See Oct 5 |
Homework 5
|
Oct
17
|
Automata on Infinite Words II
|
Subsections 4.3.3, 4.3.4
|
See Oct 12
|
|
Oct
19
|
Model Checking ω-Regular
Properties
|
Section 4.4
|
PDF
|
|
Oct
24
|
Linear Temporal Logic I
|
Section 5.1
|
PDF
|
|
Oct
26
|
Linear Temporal Logic II
|
Section 5.1
|
See Oct 24
|
|
Oct
31
|
Linear Temporal Logic III Automata-Based LTL Model
Checking I |
Section 5.1 Section 5.2 |
See Oct 24 |
|
Nov
2
|
Automata-Based LTL Model
Checking II
|
Section 5.2
|
See Oct 31
|
|
Nov
7
|
Automata-Based LTL Model
Checking III |
Section 5.2
|
See Nov 2
|
|
Nov
9
|
Complexity of LTL Model
Checking I
|
Subsection 5.2.1
|
PDF
|
|
Nov
14
|
Complexity of LTL Model
Checking II
|
Subsections 5.2.1, 5.2.2
|
See Nov 9
|
|
Nov
16
|
Computation Tree Logic
|
Sections 6.1, 6.2
|
PDF
|
|
Nov
21
|
Expressiveness of CTL vs. LTL
|
Section 6.3
|
PDF
|
|
Nov
23
|
CTL Model Checking I
|
Section 6.4
|
PDF
|
|
Nov
28
|
CTL Model Checking II
|
Section 6.4
|
See Nov 23
|
|
Nov
30
|
Fairness in CTL I
|
Section 6.5
|
PDF
|
Homework 11
|
Dec
5
|
Fairness in CTL II
Counterexamples and Witnesses I
|
Sections 6.5, 6.6
|
See Nov 30
PDF
|
|
Dec
7
|
Counterexamples and Witnesses
II
CTL* and CTL+
|
Section 6.8
|
PDF
|
Homework 12
|
Dec
12
|
Bisimulation
|
|
PDF
|
|
Dec
14
|
Discussion of Final and Course
Evaluations
|
|
|
|