Abstrakti
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.
Alkuperäiskieli | Englanti |
---|---|
Otsikko | Proceedings of the 15th IEEE International Conference on Industrial Informatics, INDIN 2017 |
Kustantaja | IEEE |
Sivut | 714-719 |
Sivumäärä | 6 |
ISBN (elektroninen) | 978-1-5386-0837-1 |
DOI - pysyväislinkit | |
Tila | Julkaistu - 13 marrask. 2017 |
OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisussa |
Tapahtuma | IEEE International Conference on Industrial Informatics - Emden, Saksa Kesto: 24 heinäk. 2017 → 26 heinäk. 2017 Konferenssinumero: 15 |
Julkaisusarja
Nimi | IEEE International Conference on Industrial Informatics |
---|---|
Kustantaja | IEEE |
ISSN (painettu) | 1935-4576 |
ISSN (elektroninen) | 2378-363X |
Conference
Conference | IEEE International Conference on Industrial Informatics |
---|---|
Lyhennettä | INDIN |
Maa/Alue | Saksa |
Kaupunki | Emden |
Ajanjakso | 24/07/2017 → 26/07/2017 |