Abstract
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.
Chapter PDF
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vaandrager, F. (1997). A theory of testing for timed automata. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030587
Download citation
DOI: https://doi.org/10.1007/BFb0030587
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive