The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning

In this paper we present TTT, a novel active automata learning algorithm formulated in the Minimally Adequate Teacher (MAT) framework. The distinguishing characteristic of TTT is its redundancy-free organization of observations, which can be exploited to achieve optimal (linear) space complexity. Th...

Full description

Saved in:
Bibliographic Details
Published inRuntime Verification pp. 307 - 322
Main Authors Isberner, Malte, Howar, Falk, Steffen, Bernhard
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2014
SeriesLecture Notes in Computer Science
Subjects
Finite Automaton
Membership Query
Model Check
Observation Table
Symbol Execution
Online AccessGet full text

Cover

More Information
Summary:In this paper we present TTT, a novel active automata learning algorithm formulated in the Minimally Adequate Teacher (MAT) framework. The distinguishing characteristic of TTT is its redundancy-free organization of observations, which can be exploited to achieve optimal (linear) space complexity. This is thanks to a thorough analysis of counterexamples, extracting and storing only the essential refining information. TTT is therefore particularly well-suited for application in a runtime verification context, where counterexamples (obtained, e.g., via monitoring) may be excessively long: as the execution time of a test sequence typically grows with its length, this would otherwise cause severe performance degradation. We illustrate the impact of TTT’s consequent redundancy-free approach along a number of examples.
ISBN:3319111639
9783319111636
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-11164-3_26