Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

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
Full-text PDF (206 kB) Citations (4)
References:
PDF
HTML
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.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 074-U01
Russian Foundation for Basic Research 14-01-0055114 а
Presented by the member of Editorial Board: O. P. Kuznetsov

Received: 10.12.2014
English version:
Automation and Remote Control, 2016, Volume 77, Issue 3, Pages 473–484
DOI: https://doi.org/10.1134/S0005117916030097
Bibliographic databases:
Document Type: Article
Language: Russian
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
Citation in format AMSBIB
\Bibitem{ChiUlySha16}
\by D.~S.~Chivilikhin, V.~I.~Ulyantsev, A.~A.~Shalyto
\paper Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas
\jour Avtomat. i Telemekh.
\yr 2016
\issue 3
\pages 137--151
\mathnet{http://mi.mathnet.ru/at14407}
\elib{https://elibrary.ru/item.asp?id=25996295}
\transl
\jour Autom. Remote Control
\yr 2016
\vol 77
\issue 3
\pages 473--484
\crossref{https://doi.org/10.1134/S0005117916030097}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000373345900009}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84962418012}
Linking options:
  • https://www.mathnet.ru/eng/at14407
  • https://www.mathnet.ru/eng/at/y2016/i3/p137
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:953
    Full-text PDF :85
    References:62
    First page:47
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024