Date Added: Jun 2010
The authors develop a testing theory for real-time systems. They keep the usual notion of success or failure (based on finite runs) but they also provide a mechanism of determining the success or failure of infinite runs, using a formalism similar to the acceptance in Buchi automata. They present two refinement timed preorders similar to De Nicola and Hennessy's may and must testing. They then provide alternative, behavioural and languagebased characterizations for these relations to show that the new preorders are extensions of the traditional preorders.