print · source · login   

Here is a tentative schedule for the problem sessions:

Week Day Lecturer Topic Book Chapter Problems
7 15-2 NJ LTL Linear Temporal Logic 5.1 (pp 229-250) + 2.1 (pp 19-23) + 3.2.2 Exx. 5.2, 5.4, 5.6 on pp. 300sqq
6 19-2 FV Automata on Infinite Words 4.3 Exx. 4.7, 4.11, 4.12, 4.13 on pp. 221sqq
9 26-2 FV Safety and Liveness Properties, Model Checking of Regular Safety Properties 3.3 (pp 107-115), 3.4 (pp 120-126), 4.2 (pp 159-170) Exx 3.5, 3.6, 4.1, 4.5 and 4.6
10 5-3 FV LTL Model Checking 5.2 Exx. 5.13, 5.18 (using common sense), Ex. 5.20 (following the algorithm)
11 12-3 FV CTL Computation Tree Logic, Expressiveness of CTL vs LTL, Model Checking CTL 6.1-6.4 Exx. 6.1, 6.2, 6.3, 6.4, 6.14, 6.16
13 26-3 NJ State Space Explosion Binary Decision Diagrams 6.7.3-6.7.4 Prove the Theorem on Slide 31 of the lecture, Exx 6.10, 6.11
16 16-4 NJ Probabilistic Systems Discrete-time Markov Chains Ex. 10.1 (a, b and c), 10.2 (at least a and b)
17 23-4 NJ Markov Decision Processes MDP Exercise and 10.22
19 7-5 NJ Probabilistic Computation Tree Logic 10.4, download the tool PRISM and solve this PRISM exercise
22 28-5 FV Timed Systems Timed Automata 9.1–9.2; see also this Uppaal tutorial Exx 9.2 and (using Uppaal) 9.3. Solution for 9.3.2: BK9_3.xml
23 4-6 NJ Probabilistic Systems Parametric Systems, PRISM language Exercise Parametric Systems
24 11-6 NJ Model Checking for Safe AI Exercise Permissive Schedulers
25 18-6
26 28-6 -- Exam