Learning communicating state machines

DOI10.1007/978-3-030-31157-5_8MaRDI QIDQ6536172zbMATH OpenFDO

Authors Alexandre Petrenko, Florent Avellaneda

Publication date 5 April 2024

Full work available at URL https://doi.org/10.1007/978-3-030-31157-5_8

zbMATH Keywords

active inferenceadaptive testingcommunicating FSMscomponent-based systemsconformance testingFSM learningSAT solvingtesting in context

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Active learning of nondeterministic finite state machines
• Compositional automata learning of synchronous systems
• Fundamental Approaches to Software Engineering
• Active learning for extended finite state machines
• Benchmarks for automata learning and conformance testing

Cites work

• CGE: a sequential learning algorithm for Mealy automata
• Complexity of automaton identification from given data
• Exact DFA Identification Using SAT Solvers
• Fundamental Approaches to Software Engineering
• Grammatical inference. Learning automata and grammars.
• scientific article; zbMATH DE number 1916673 (Why is no real title available?)
• Learning regular sets from queries and counterexamples
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Sequential Machine Identification
• The Unknown Component Problem
• Theory and Applications of Satisfiability Testing

Cited in

(1)

• Compositional automata learning of synchronous systems

This page was built for publication: Learning communicating state machines

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