CSP-based inference of function block finite-state models from execution traces

Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto, Valeriy Vyatkin

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

2 Citations (Scopus)

Abstract

A method for inferring finite-state models of function blocks from given execution traces based on translation to the constraint satisfaction problem (CSP) is proposed. In contrast to the previous method based on a metaheuristic algorithm, the approach suggested in this paper is exact: it allows to find a solution if it exists or to prove the opposite. The proposed method is evaluated on the example of constructing a finite-state model of a controller for a Pick-and-Place manipulator and is shown to be significantly faster then the metaheuristic algorithm.
Original languageEnglish
Title of host publicationProceedings of the 15th IEEE International Conference on Industrial Informatics, INDIN 2017
PublisherIEEE
Pages714-719
Number of pages6
ISBN (Electronic)978-1-5386-0837-1
DOIs
Publication statusPublished - 13 Nov 2017
MoE publication typeA4 Article in a conference publication
EventIEEE International Conference on Industrial Informatics - Emden, Germany
Duration: 24 Jul 201726 Jul 2017
Conference number: 15

Publication series

NameIEEE International Conference on Industrial Informatics
PublisherIEEE
ISSN (Print)1935-4576
ISSN (Electronic)2378-363X

Conference

ConferenceIEEE International Conference on Industrial Informatics
Abbreviated titleINDIN
CountryGermany
CityEmden
Period24/07/201726/07/2017

Fingerprint Dive into the research topics of 'CSP-based inference of function block finite-state models from execution traces'. Together they form a unique fingerprint.

Cite this