Active automata learning for real life applications

@inproceedings{Merten2013ActiveAL,
  title={Active automata learning for real life applications},
  author={Maik Merten},
  year={2013}
}
Acknowledgements I want to thank Bernhard Steffen for guiding me during the past five years. Clearly, this dis-sertation is a result of having being challenged, motivated, and supported in a truly unique environment, created by the persons that gathered at the Chair of Programming Systems to create and cooperate. Thus I would also like to thank my colleagues, and in particular Falk Howar, with whom I had the pleasure of sharing an office for three years. Hilarity sure ensued, as did pleasant… Expand
Foundations of active automata learning: an algorithmic perspective
TLDR
One of the stated goals of this thesis is to change this situation, by giving a rigorously formal description of an approach to active automata learning that is independent of specific data structures or algorithmic realizations. Expand
Property-Directed Verification and Robustness Certification of Recurrent Neural Networks
This paper presents a property-directed approach to verifying recurrent neural networks (RNNs). To this end, we learn a deterministic finite automaton as a surrogate model from a given RNN usingExpand
On-the-fly Black-Box Probably Approximately Correct Checking of Recurrent Neural Networks
TLDR
This work proposes a procedure for checking properties of recurrent neural networks used for language modeling and sequence classification based on learning a probably approximately correct, regular approximation of the intersection of the language of the black-box with the complement of the property to be checked, without explicitly building individual representations of them. Expand
Learning Time Delay Mealy Machines From Programmable Logic Controllers
TLDR
This paper introduces the time delay Mealy machine and demonstrates that it is sufficiently expressive to model PLC software, and implement a custom learning method to learn models from several industrial examples and analyze the efficiency. Expand
Minimal Synthesis of String To String Functions From Examples
TLDR
It is proved that, in general, this problem of synthesizing string to string transformations from a set of input/output examples is NP-complete, and several NP-hardness proofs are provided that show the hardness of multiple (independent) variants of the problem. Expand
Regular Inference on Artificial Neural Networks
TLDR
The goal is to construct a representation which enhances human understanding of an ANN as a sequence classifier, with the purpose of providing insight on the rationale behind the classification of a sequence as positive or negative, to enable performing further analyses, such as automata-theoretic formal verification. Expand
Model learning: a survey of foundations, tools and applications
TLDR
This paper surveys the model learning technique, which recently has attracted much attention from researchers, especially from the domains of testing and verification, by providing behavior models of blackbox systems fully automatically. Expand
Automatically learning formal models: an industrial case from autonomous driving development
TLDR
This industrial case study applies active learning techniques to obtain formal models from an existing autonomous driving software (in development) implemented in MATLAB and demonstrates the feasibility of active automata learning algorithms for automotive industrial use. Expand
Testing-based Model Learning Approach for Legacy Components
TLDR
An approach which is based on the state of the art dynamic analysis technique known as Model Learning, a reverse engineering approach, to infer the behavioral models of legacy systems to modernize the legacy components and explore the concealed structures of the black-box systems automatically. Expand
Automata Learning for Automated Test Generation of Real Time Localization Systems
TLDR
This work presents a procedure for automatic test case generation with automata learning and applies this approach in a case study to a localization system. Expand
...
1
2
...

References

SHOWING 1-10 OF 87 REFERENCES
Learning I/O Automata
TLDR
It is shown that, by exploiting links between three widely used modeling frameworks for reactive systems, any tool for active learning of Mealy machines can be used for learning I/O automata that are deterministic and output determined. Expand
Reusing System States by Active Learning Algorithms
TLDR
A practical optimization to active automata learning is presented that reduces the average execution time per query as well as the number of actual tests to be executed, and is applicable to an industry-scale web-application running on an enterprise platform. Expand
Domain-Specific Optimization in Automata Learning
TLDR
By optimizing a standard learning method according to domain-specific structural properties, this work is able to generate abstract models for complex reactive systems by optimizing general learning procedures by capitalizing on specific application profiles. Expand
Automata Learning with Automated Alphabet Abstraction Refinement
TLDR
This paper introduces a method for refining a given abstraction to automatically regain a deterministic behavior on-the-fly during the learning process, with the effect that detected nondeterminism does not lead to failure, but to a dynamic alphabet abstraction refinement. Expand
libalf: The Automata Learning Framework
TLDR
This paper presents libalf, a comprehensive, open-source library for learning formal languages libalf covers various well-known learning techniques for finite automata as well as novel learning algorithms. Expand
Learning of Automata Models Extended with Data
TLDR
A longer account of an approach proposed by Aarts et al, which adapts ideas from of predicate abstraction, successfully used in formal verification, for learning models of networked components from exploratory interaction with the component. Expand
Dynamic testing via automata learning
This paper presents dynamic testing, a method that exploits automata learning to systematically test (black box) systems almost without prerequisites. Based on interface descriptions and optionalExpand
LearnLib: a library for automata learning and experimentation
TLDR
The LearnLib is presented, a library for automata learning and experimentation that allows users to configure their tailored learning scenarios, which exploit specific properties of the envisioned applications. Expand
On Handling Data in Automata Learning - Considerations from the CONNECT Perspective
TLDR
This paper considers how the techniques of automata learning can be adapted to the problem of learning interaction models in which data parameters are an essential element, and focuses on how test-drivers for real-word systems can be generated automatically. Expand
On the learnability of infinitary regular sets
TLDR
A polynomial algorithm for learning a sub-class of the ω-regular sets from membership queries and counter-examples based on the framework suggested by Angluin for learning regular subsets of Σ*. Expand
...
1
2
3
4
5
...