Test-based extended finite-state machines induction with evolutionary algorithms and ant colony optimization

Abstract

In this paper we consider the problem of extended finite-state machines induction. The input data for this problem is a set of tests. Each test consists of two sequences - an input sequence and a corresponding output sequence. We present a new method of Extended Finite-State Machines (EFSM) induction based on an Ant Colony Optimization algorithm (ACO) and a… (More)
DOI: 10.1145/2330784.2330883
View Slides

2 Figures and Tables

Topics

  • Presentations referencing similar topics