|
Avtomatika i Telemekhanika, 2016, Issue 3, Pages 137–151
(Mi at14407)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Logic Control
Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas
D. S. Chivilikhin, V. I. Ulyantsev, A. A. Shalyto ITMO University, St. Petersburg, Russia
Abstract:
We solve the problem of constructing extended finite state machines with execution scenarios and temporal formulas. We propose a new algorithm pstMuACO that combines a scenario filtering procedure, an exact algorithm efsmSAT for constructing finite state machines from execution scenarios based on a reduction to the Boolean satisfiability problem, and a parallel ant colony algorithm pMuACO. Experiments show that constructing several initial solutions for the ant colony algorithm with reduced sets of scenarios significantly reduces the total time needed to find optimal solutions. The proposed algorithm can be used for automated construction of reliable control systems.
Citation:
D. S. Chivilikhin, V. I. Ulyantsev, A. A. Shalyto, “Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas”, Avtomat. i Telemekh., 2016, no. 3, 137–151; Autom. Remote Control, 77:3 (2016), 473–484
Linking options:
https://www.mathnet.ru/eng/at14407 https://www.mathnet.ru/eng/at/y2016/i3/p137
|
Statistics & downloads: |
Abstract page: | 935 | Full-text PDF : | 75 | References: | 58 | First page: | 46 |
|