On the correspondence between conformance testing and regular inference

  • Authors:
  • Therese Berg;Olga Grinchtein;Bengt Jonsson;Martin Leucker;Harald Raffelt;Bernhard Steffen

  • Affiliations:
  • Department of Computer Systems, Uppsala University, Sweden;Department of Computer Systems, Uppsala University, Sweden;Department of Computer Systems, Uppsala University, Sweden;Institute of Informatics, TU Munich, Germany;LS V, Universität Dortmund, Germany;LS V, Universität Dortmund, Germany

  • Venue:
  • FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.