Automata Learning with Automated Alphabet Abstraction Refinement - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Automata Learning with Automated Alphabet Abstraction Refinement

Résumé

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.
Fichier non déposé

Dates et versions

hal-00647711 , version 1 (02-12-2011)

Identifiants

  • HAL Id : hal-00647711 , version 1

Citer

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. ⟨hal-00647711⟩

Collections

CONNECT
95 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More