Summary for Week 3
-
Lecture 5, 6, and 7:In these three lectures we covered the model checking algorithm
for CTL and briefly discussed Binary Decsion Diagrams, an efficient data structure
for representing boolean function. This subject will not be covered in the homeworks.
For additional information about these subjects students should read Chapters 4,5, and
6 in the Model Checking book by Clarke-Grumberg-Peled. For a detailed description of
Binary Decision Diagrams or BDDs please read the following
paper.
Dates:Mon, 9/17/01, Wed, 9/19/01, and Fri, 9/21/01.