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

DOI10.1134/S0005117916030097zbMath1348.93155OpenAlexW2317988951MaRDI QIDQ334220

V. I. Ulyantsev, A. A. Shalyto, D. S. Chivilikhin

Publication date: 1 November 2016

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117916030097

Mathematics Subject Classification ID

Related Items (1)

The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm

Uses Software

• irace
• SPOT
• MuACOsm

Cites Work

• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• Algorithmic graph schemes and transition graphs: Their application in software realization of logical control algorithms. II
• Exact DFA Identification Using SAT Solvers
• Complexity of automaton identification from given data
• Manipulating LTL Formulas Using Spot 1.0

This page was built for publication: Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas