Automata Learning with Automated Alphabet Abstraction Refinement

Abstract : Abstraction is the key when learning behavioral models of realistic systems, but also the cause of a major problem: the introduction of non-determinism. In this paper, we introduce a method for refining a given abstraction to automatically regain a deterministic behavior on-the-fly during the learning process. Thus the control over abstraction becomes part of the learning process, with the effect that detected nondeterminism does not lead to failure, but to a dynamic alphabet abstraction refinement. Like automata learning itself, this method in general is neither sound nor complete, but it also enjoys similar convergence properties even for infinite systems as long as the concrete system itself behaves deterministically, as illustrated along a concrete example.
Type de document :
Communication dans un congrès
Twelfth International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2011, Jan 2011, Austin, Texas, United States. 2011, 〈http://www.springerlink.com/content/5855482385085584/〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00647711
Contributeur : Falk Howar <>
Soumis le : vendredi 2 décembre 2011 - 15:18:18
Dernière modification le : vendredi 2 décembre 2011 - 15:50:10

Identifiants

  • HAL Id : hal-00647711, version 1

Collections

Citation

Falk Howar, Bernhard Steffen, Maik Merten. Automata Learning with Automated Alphabet Abstraction Refinement. Twelfth International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2011, Jan 2011, Austin, Texas, United States. 2011, 〈http://www.springerlink.com/content/5855482385085584/〉. 〈hal-00647711〉

Partager

Métriques

Consultations de la notice

93