Active learning for extended finite state machines

DOI10.1007/S00165-016-0355-5zbMATH Open1342.68174OpenAlexW2213779776MaRDI QIDQ736459FDOQ736459

Bengt Jonsson, Bernhard Steffen, S. Cassel, Falk Howar

Publication date: 4 August 2016

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-016-0355-5

Recommendations

• Active learning of nondeterministic finite state machines
• Fundamental results for learning deterministic extended finite state machines from queries
• Active learning for deterministic bottom-up nominal tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cites Work

• The Daikon system for dynamic detection of likely invariants
• Reo: a channel-based coordination model for component composition
• Sigma*
• Learning regular sets from queries and counterexamples
• Generating models of infinite-state communication protocols using regular inference with abstraction
• Title not available (Why is that?)
• Model-based testing of reactive systems. Advanced lectures.
• Mining specifications
• Synthesis of interface specifications for Java classes
• Software model checking
• Inference of finite automata using homing sequences
• Computer Aided Verification
• Inferring Canonical Register Automata
• Automata Learning with Automated Alphabet Abstraction Refinement
• Automata Learning through Counterexample Guided Abstraction Refinement
• Title not available (Why is that?)
• Learning register automata: from languages to program structures
• Improving active Mealy machine learning for protocol conformance testing
• Title not available (Why is that?)
• A Fresh Approach to Learning Register Automata
• Active learning for extended finite state machines

Cited In (24)

• \(L^\ast\)-based learning of Markov decision processes (extended version)
• Efficient active automata learning via mutation testing
• Grey-Box Learning of Register Automata
• Enhancing active model learning with equivalence checking using simulation relations
• Never-stop context-free learning
• Polynomial-time equivalence testing for deterministic fresh-register automata
• Active learning for extended finite state machines
• Model checking, synthesis, and learning
• Active learning for deterministic bottom-up nominal tree automata
• A Myhill-Nerode theorem for register automata and symbolic trace languages
• Fast computations on ordered nominal sets
• Active learning for sound negotiations
• A taxonomy and reductions for common register automata formalisms
• Fundamental results for learning deterministic extended finite state machines from queries
• Learning One-Clock Timed Automata
• Models of active learning in group-structured state spaces
• Compositional automata learning of synchronous systems
• Learning Symbolic Automata
• Automata and grammars for data words
• A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
• A new approach for active automata learning based on apartness
• \(L^*\)-based learning of Markov decision processes
• Inferring regular languages and \(\omega\)-languages
• An active learning approach to synthesizing program contracts

Uses Software

• Daikon
• z3
• Reo
• LearnLib
• RALib
• Sigma*

This page was built for publication: Active learning for extended finite state machines

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