Title: 'Formal verification of hybrid systems"

			    Sayan Mitra
    Center for the Mathematics of Information
       California Institute of Technology

ABSTRACT: Today's embedded software systems involve complex
interactions between software components and physical processes. This
combination of discrete and continuous behavior calls for new design
and analysis methodologies bringing together ideas and tools from
control theory and computer science. Hybrid automaton is a formalism
for describing and analyzing blueprints of embedded systems. Verifying
a hybrid automaton typically involves establishing that it is safe,
stable, or that it implements an abstract specification.

In this talk, I will first describe the semantics of Hybrid
Input/Output Automata. Next, I will present some well-established
techniques for algorithmic safety verification and discuss the key
challenges in this approach. Finally, I will describe techniques for
deductive verification that can be partially automated with mechanical
theorem provers.