Efficient active automata learning via mutation testing

DOI10.1007/S10817-018-9486-0MaRDI QIDQ2331082zbMATH OpenOpenAlexWikidataFDO

Authors Bernhard K. Aichernig, Martin Tappler

Publication date 25 October 2019

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10817-018-9486-0

zbMATH Keywords

active automata learningconformance testingFSM-based testingminimally adequate teacher frameworkmutation testing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Active model learning of stochastic reactive systems
• Benchmarking combinations of learning and testing algorithms for active automata learning
• Grey-Box Checking
• Combining black-box and white-box techniques for learning register automata
• Reverse Engineering Through Automata Learning

Cites work

• Active learning for extended finite state machines
• Automata learning with automated alphabet abstraction refinement
• Fundamental Approaches to Software Engineering
• scientific article; zbMATH DE number 1418458 (Why is no real title available?)
• Inference of finite automata using homing sequences
• Learning register automata: from languages to program structures
• Learning regular sets from queries and counterexamples
• Testing finite-state machines: state identification and verification
• Testing Software Design Modeled by Finite-State Machines

Cited in

(9)

• \(L^\ast\)-based learning of Markov decision processes (extended version)
• Improving active Mealy machine learning for protocol conformance testing
• Active model learning of stochastic reactive systems
• Compositional learning for interleaving parallel automata
• Learning deterministic one-clock timed automata via mutation testing
• Benchmarking combinations of learning and testing algorithms for active automata learning
• L^*-based learning of Markov decision processes
• Active learning for sound negotiations
• Benchmarking combinations of learning and testing algorithms for automata learning

Describes a project that uses

Uses Software

• LearnLib
• mut-learn
• MQTT
• GitHub

This page was built for publication: Efficient active automata learning via mutation testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331082)