15-453 Formal Languages, Automata, and Computation
Lecture 4: Model Checking

This lecture continues the discussion of applications of finite state systems. We show Binary Decision Diagrams (BDDs) and illustrate their use for verifying properties of systems represented as finite state machines.

• Lecture notes: lecture04.ps, lecture04.pdf
• Previous lecture: Applications of Finite State Machines
• Next lecture: Non-Deterministic Finite Automata

[ Home | Schedule | Assignments | Handouts | Overview ]

fp@cs
Frank Pfenning