1. SS 2018 Software Verification LTL Satisfiability applied
Prof. Dr. Holger Schlingloff 1,2
Dr. Esteban Pavese 1
(1) Institut für Informatik der Humboldt Universität
(2) Fraunhofer Institut für offene Kommunikationssysteme FOKUS

2. Remember?
Properties vs. formulas?
Dining Philosophers?

3. Example: Dining Philosophers
Signature: P={philieating, forkiavailable, philihasLeftFork, philihasRightFork}
Modelling as parallel FSMs
Translating FSMs into LTL

4. Coding a Model in LTL
Given a finite Kripke model M, define a linear temporal formula φM such that M||-  iff ||- (φM  )
Reminder: ||- (φM  ) iff (φM ) is unsatisfiable
Reduction of model checking to (temporal) satisfiability
Bounded model checking uses this approach (e.g. nuSMV with Zchaff)

5. Demo