Learning deterministic one-clock timed automata via mutation testing
From MaRDI portal
(Redirected from Publication:6160914)
Recommendations
- Active learning of one-clock timed automata using constraint solving
- Learning one-clock timed automata
- Time to learn -- learning timed automata from tests
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Cites work
- A theory of timed automata
- Active learning of timed automata with unobservable resets
- Combining black-box and white-box techniques for learning register automata
- Conformance testing for real-time systems
- Efficient active automata learning via mutation testing
- Fundamental Approaches to Software Engineering
- scientific article; zbMATH DE number 1916673 (Why is no real title available?)
- Improving active Mealy machine learning for protocol conformance testing
- Learning Mealy machines with one timer
- Learning of event-recording automata
- Learning one-clock timed automata
- Learning regular sets from queries and counterexamples
- Syntax and consistent equation semantics of hybrid Chi
- Testing Software Design Modeled by Finite-State Machines
Cited in
(5)
This page was built for publication: Learning deterministic one-clock timed automata via mutation testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160914)