Lecture
5
11
Model checking
n
Example
n
A
=
a -> b -> A
n
B
=
c -> d -> B
n
n
S
=
A ||| B
n
n
Temporal operators:
n
F : forever
n
E : eventually
n
n
Some formulae
n
F E (a or c)
n
F E a
n
E F (a or c)
n
n
A
=
a -> A1
A1
=
b -> A
B
=
c -> B1
B1
=
d -> B
S
=
A ||| B
S1
= A
||| B1
S2 =
A1 ||| B
S3 = A1 ||| B1
S
S2
S1
S3
c
c
a
a
d
b
b
d
True
False
False