Skip to Main content Skip to Navigation
New interface
Conference papers

Learning of Automata Models Extended with Data

Abstract : One of the challenges in the Connect project is to develop techniques for learning models of networked components from exploratory interaction with the component, based on analyzing messages exchanged between the component and its environment. Many approaches to this problem employ regular inference (aka. automata learning) techniques which generate modest-size finite-state models. Most communication with real-life systems involves data values being relevant to the communication context and thus influencing the observable behavior of the communication endpoints. When applying methods from the realm of automata learning, it is desirable to handle such data occurrences. It is therefore important to extend inference techniques to handle message alphabets and state-spaces with structures containing data parameters, often with large domains. After very briefly mentioning several approaches to the problem, we give a longer account of an approach proposed by Aarts et al, which adapts ideas from of predicate abstraction, successfully used in formal verification. We illustrate the techniques by application to a simple running example, which models a simple booking service.
Document type :
Conference papers
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download
Contributor : Sofia Cassel Connect in order to contact the contributor
Submitted on : Friday, December 2, 2011 - 12:15:11 PM
Last modification on : Friday, December 2, 2011 - 1:44:26 PM
Long-term archiving on: : Saturday, March 3, 2012 - 2:30:26 AM


Files produced by the author(s)


  • HAL Id : hal-00647576, version 1



Bengt Jonsson. Learning of Automata Models Extended with Data. SFM-11, 2011, Bertinoro, Italy. ⟨hal-00647576⟩



Record views


Files downloads