Lecture 5
10
Model checking
nModel checking
basics
nThe security property we want to verify is expressed as a temporal logic formula F
nThe protocol is expressed as a system S of processes (the processes involved with the protocol
and, possibly, the
intruder)
nS is represented as a labeled transition system T, which is seen as an interpretation of
F
nModel checking consists in showing that T is a model of F, namely that T validates F
nAlways possible with Finite State systems
nAlso possible for some restricted cases of Infinite State systems