Lectures 5-6. Assignment 1 due. Automata-theoretic model-checking, linear-time
temporal logic, model-checker SPIN. The SPIN notes are available in [PDF]
formats. Additionally, we will look into closure under stuttering
problems associated with property verification in SPIN.
Lecture 7. Finish up SPIN (a few more examples). .Process algebras: CCS and
its verification tool Concurrency Workbench.