April 17, Tuesday
10:00 – 12:00
Automata as Abstractions
Computer Science seminar
Lecturer : Dr. Dennis Dams
Affiliation : Bell Labs Computing Sciences Center
Location : 202/37
Host : Dr. Michael Elkin
We propose the use of tree automata as abstractions in the verification of branching time properties, and show several benefits. In this setting, soundness and completeness are trivial. It unifies the abundance of frameworks in the literature, and clarifies the role of concepts therein in terms of the well-studied field of automata theory. Moreover, using automata as models simpli fies and generalizes results on maximal model theorems.