51:09
Timed transition systems
01:54
Concluding remarks
01:52
Summary
18:19
Representing transition systems as OBDDs
40:27
Ordered BDDs
25:22
Introduction to BDDs
02:01
Summary
07:30
State-space explosion
14:16
Final algorithm
24:49
EX, EU, EG
28:08
Adequate CTL formulae
01:52
summary
31:57
CTL
26:24
CTL*
27:11
Tree view of a transition system
01:56
Summary
38:47
Automaton construction
27:43
LTL to NBA
37:42
Automata based LTL model-checking
02:08
Summary
30:12
A puzzle
27:10
Semantics of LTL
28:13
Introduction to LTL
29:59
Omega-regular expressions to NBA
02:22
Summary
17:21
Generalized NBA
30:53
Checking emptiness of NBA
10:40
Overview
02:04
Summary....
33:48
Simple properties of Bchi automata
17:53
Bchi automata
25:43
Omega-regular expressions
08:10
Specifying properties
02:02
Summary...
17:46
Safety properties described by automata
50:38
Simple properties of finite automata
47:24
A gentle introduction to automata
15:00
Road map
24:38
Liveness properties
26:32
A problem in concurrency
02:31
Summary
18:56
Safety properties
23:35
Invariants
17:19
What is a property?
07:29
Model checking tools
36:05
Simple models in NuSMV
32:44
Hardware verification using NuSMV
41:54
Modeling concurrent systems in NuSMV
01:08
Summary
08:02
Course Overview
11:56
Modeling code behaviour
19:10
Modeling hardware circuits
17:44
Modeling data-dependent programs
42:21
Modeling concurrent systems
02:02
Summary
03:15
model checking intro
X
About
Tags