Techniques For Automatic Verification Of Real Time Systems

In the proposed verification method, a finite state system is modeled as a composition of time automata, and the correctness is specified either as a deterministic timed automaton, or as a formula of MITL or TCTL. In each case we develop an algorithm for model checking. The distinguishing feature of our work is the use of the set of reals to model time; we argue that the denseness of the time domain is crucial for modeling event-driven asynchronous systems. The thesis also clarifies the relationship between different models and logics for real-time, and answers some basic questions regarding complexity, decidability, and expressiveness."