15-399 Constructive Logic
Lecture 25: Model Checking
We complete the discussion of computation tree logic (CTL) and show
how the general schema can be instantiated to the case where the number
of states and atomic propositions is finite. For this case, we propose
a particular algorithm to decide if a given CTL proposition is true
or not.
[ Home
| Schedule
| Assignments
| Handouts
| Software
| Overview
]
fp@cs
Frank Pfenning
|