Improving active Mealy machine learning for protocol conformance testing
DOI10.1007/s10994-013-5405-0zbMath1317.68087OpenAlexW2084056389MaRDI QIDQ479471
Fides Aarts, Jan Tretmans, Harco Kuppens, Sicco Verwer, Frits W. Vaandrager
Publication date: 5 December 2014
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-013-5405-0
model checkingactive learningmodel-based testingautomaton learningMealy machinesprotocol learningstate machine synthesis
Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficiently identifying deterministic real-time automata from labeled data
- Learning regular sets from queries and counterexamples
- A theory of timed automata
- Symbolic model checking for real-time systems
- A logic for reasoning about time and reliability
- Inference of \(\omega\)-languages from prefixes.
- Model-based testing of reactive systems. Advanced lectures.
- CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
- Process Mining
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- Learning I/O Automata
- Assessing Test Data Adequacy through Program Inference
- Complexity of automaton identification from given data
- Automata Learning through Counterexample Guided Abstraction Refinement
- Mining specifications
- Fundamental Approaches to Software Engineering
- Formal Methods for the Design of Real-Time Systems
- Formal Approaches to Software Testing
- Inference of Event-Recording Automata Using Timed Decision Trees
- Computer Aided Verification
This page was built for publication: Improving active Mealy machine learning for protocol conformance testing