Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas

被引：0
|
作者：
D. S. Chivilikhin
V. I. Ulyantsev
A. A. Shalyto
机构：
[1] ITMO University,
来源：
Automation and Remote Control | 2016年 / 77卷
关键词：
Remote Control; State Machine; Finite State Machine; Constraint Satisfaction Problem; Boolean Formula;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：473 / 484
页数：11
相关论文
共 13 条
  • [1] Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas
    Chivilikhin, D. S.
    Ulyantsev, V. I.
    Shalyto, A. A.
    AUTOMATION AND REMOTE CONTROL, 2016, 77 (03) : 473 - 484
  • [2] Learning Finite-State Machines with Ant Colony Optimization
    Chivilikhin, Daniil
    Ulyantsev, Vladimir
    SWARM INTELLIGENCE (ANTS 2012), 2012, 7461 : 268 - 275
  • [3] Inducing finite state machines from training samples using ant colony optimization
    I. P. Buzhinsky
    V. I. Ulyantsev
    D. S. Chivilikhin
    A. A. Shalyto
    Journal of Computer and Systems Sciences International, 2014, 53 : 256 - 266
  • [4] Inducing finite state machines from training samples using ant colony optimization
    Buzhinsky, I. P.
    Ulyantsev, V. I.
    Chivilikhin, D. S.
    Shalyto, A. A.
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2014, 53 (02) : 256 - 266
  • [5] MuACOsm - A New Mutation-Based Ant Colony Optimization Algorithm for Learning Finite-State Machines
    Chivilikhin, Daniil
    Ulyantsev, Vladimir
    GECCO'13: PROCEEDINGS OF THE 2013 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2013, : 511 - 518
  • [6] A Modified Max-Min Ant Colony Optimization Algorithm for Virtual Machines Replacement in Cloud Datacenter
    Ren, Tiantian
    Huang, Xinli
    2014 IEEE INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE (IPCCC), 2014,
  • [7] LANG - algorithm for constructing unique input/output sequences in finite-state machines
    Ahmad, I
    Ali, FM
    Das, AS
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2004, 151 (02): : 131 - 140
  • [8] Combining Exact And Metaheuristic Techniques For Learning Extended Finite-State Machines From Test Scenarios and Temporal Properties
    Chivilikhin, Daniil
    Ulyantsev, Vladimir
    Shalyto, Anatoly
    2014 13TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA), 2014, : 350 - 355
  • [9] Learning Finite-State Machines with Classical and Mutation-Based Ant Colony Optimization: Experimental Evaluation
    Chivilikhin, Daniil
    Ulyantsev, Vladimir
    2013 1ST BRICS COUNTRIES CONGRESS ON COMPUTATIONAL INTELLIGENCE AND 11TH BRAZILIAN CONGRESS ON COMPUTATIONAL INTELLIGENCE (BRICS-CCI & CBIC), 2013, : 528 - 533
  • [10] Test-Based Extended Finite-State Machines Induction with Evolutionary Algorithms and Ant Colony Optimization
    Chivilikhin, Daniil
    Ulyantsev, Vladimir
    Tsarev, Fedor
    PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION COMPANION (GECCO'12), 2012, : 603 - 606
12