On the Correspondence Between Conformance Testing and Regular Inference
Conformance testing for finite state machines and regular inference both aim at identifying the model structure underlying a black box system on the basis of a limited set of observations. Whereas the former technique checks for equivalence with a given conjecture model, the latter techniques addresses the corresponding synthesis problem by means of techniques adopted from automata learning. In this paper we establish a common framework to investigate the similarities of these techniques by showing how results in one area can be transferred to results in the other and to explain the reasons for their differences.
- [BDG97]Balcázar, J.L., Díaz, J., Gavaldá, R.: Algorithms for learning finite automata from queries: A unified view. In: Advances in Algorithms, Languages, and Complexity, pp. 53–72. Kluwer, Dordrecht (1997)Google Scholar
- [PVY99]Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Formal Methods for Protocol Engineering and Distributed Systems, FORTE/PSTV, Beijing, China, pp. 225–240. Kluwer, Dordrecht (1999)Google Scholar
- [VCI90]Vuong, S.T., Chan, W.Y.L., Ito, M.R.: The UIOv-method for protocol test sequence generation. In: Proc. 2nd Int. Workshop on Protocol Test Systems, pp. 161–176. North-Holland, Amsterdam (1990)Google Scholar