15-399 Constructive Logic
Lecture 23: Finite State Systems

We finish the discussion of applications of SAT and related questions about Boolean functions. Then we introduce finite-state systems that are used to model (among other things) concurrent programs or processes. The particular example we discuss is mutual exclusion, a finite state system guaranteeing that two processes do not access the same resource the same time.

[ Home | Schedule | Assignments | Handouts | Software | Overview ]

Frank Pfenning