2018 · 12 citations · 8 references
ComputingComputer ScienceArtificial IntelligenceMachine LearningSystems ModelingAutomata TheoryFinite State Machine ModelingFinite-state MachinesModel CheckingModel-driven Software EngineeringSoftware TestingAutomata LearningBlack Box ModelingBlack-box TestingFinite-state VerificationHeuristic ApproachModel-based TestingState Machine ModelsState Models
Machine learning in the form of inference of state machine models has gained popularity in model-based testing as a means of retrieving models from software systems. By combining an old idea from machine inference with methods from automata testing in a heuristic approach, we propose a new promising direction for inferring black box systems that cannot be reset. Preliminary experiments show that this heuristic approach scales up well and outperforms more systematic approaches.
8
Learning regular sets from queries and counterexamples
Dana Angluin · Information and Computation · 1987 · 2.1K citations
Glenn Ammons, Rastislav Bodík, James R. Larus · 2002 · 669 citations · Full text
M. P. Vasilevskii · Cybernetics and Systems Analysis · 1975 · 219 citations