A theory of testing for timed automata
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1214)
I Invited Lectures Lectures
We present a generalization of the classic theory of testing for (finite state) Mealy machines to a setting of timed automata in the style of Alur and Dill.
© Springer-Verlag Berlin Heidelberg 1997