Sökning: onr:"swepub:oai:DiVA.org:ltu-67632" >
CSP-based inference...
CSP-based inference of function block finite-state models from execution traces
-
- Chivilikhin, Daniil S. (författare)
- Computer Technologies Laboratory, ITMO University, Saint Petersburg
-
- Ulyantsev, Vladimir I. (författare)
- Computer Technologies Laboratory, ITMO University, Saint Petersburg
-
- Shalyto, Anatoly A (författare)
- Computer Technologies Laboratory, ITMO University, Saint Petersburg
-
visa fler...
-
- Vyatkin, Valeriy (författare)
- Luleå tekniska universitet,Datavetenskap,Computer Technologies Laboratory, ITMO University, Saint Petersburg
-
visa färre...
-
(creator_code:org_t)
- Piscataway, NJ : Institute of Electrical and Electronics Engineers (IEEE), 2017
- 2017
- Engelska.
-
Ingår i: Proceedings. - Piscataway, NJ : Institute of Electrical and Electronics Engineers (IEEE). - 9781538608371 ; , s. 714-719
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Dependable Communication and Computation Systems
- Kommunikations- och beräkningssystem
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas