Number

Date

Subject

Reading Material

1

Jan 7

Introduction to timed automata

Slides

2

Jan 9

Timed languages and timed automata

Slides

3

Jan 16

Language emptiness for timed automata

Notes

4

Jan 21

Undecidability of inclusion

Slides

5

Jan 23

A decidable case of language inclusion

Slides

6

Jan 28

Discussion of Tutorial 2


7

Jan 30

Determinizing timed automata

Slides

8

Feb 4

Discussion of Tutorial 3


9

Feb 6

Alternating timed automata

Slides
Paper

10

Feb 13

Casestudy: Pacemaker verification

Slides
Jiang's
slides Paper

11

Feb 18

Timed automata with diagonal constraints

Notes


Feb 25

Midsemester Exam

Question paper

12

Mar 11

Reachability algorithm using zones

Notes

13

Mar 13

Operations on zones

Partial notes

14

Mar 18

Nonconvex abstractions

Notes

15

Mar 21

Better abstractions through better constants

Slides

16

Mar 25

NonZenoness


17

Apr 1

Discussion of Tutorial 4


18

Apr 3

Problem session

Notes

19

Apr 8

Discussion of Tutorial 5


20

Apr 10

Discussion of Tutorial 6


21

Apr 15

Timed automata reachability is PSPACEcomplete


22

Apr 17

Problem session

