Abstract
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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Berg, T., Grinchtein, O., Jonsson, B., Leucker, M., Raffelt, H., & Steffen, B. (2005). On the correspondence between conformance testing and regular inference. In Lecture Notes in Computer Science (Vol. 3442, pp. 175–189). Springer Verlag. https://doi.org/10.1007/978-3-540-31984-9_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.