Sökning: onr:"swepub:oai:DiVA.org:ltu-75721" >
Function Block Fini...
Function Block Finite-State Model Identification Using SAT and CSP Solvers
-
- Chivilikhin, Daniil (författare)
- Computer Technologies Laboratory, ITMO University, St. Petersburg, Russia
-
- Ulyantsev, Vladimir (författare)
- Computer Technologies Laboratory, ITMO University, St. Petersburg, Russia
-
- Shalyto, Anatoly (författare)
- Computer Technologies Laboratory, ITMO University, St. Petersburg, Russia
-
visa fler...
-
- Vyatkin, Valeriy (författare)
- Luleå tekniska universitet,Datavetenskap,Department of Electrical Engineering and Automation, Aalto University, Espoo, Finland
-
visa färre...
-
Computer Technologies Laboratory, ITMO University, St Petersburg, Russia Datavetenskap (creator_code:org_t)
- IEEE, 2019
- 2019
- Engelska.
-
Ingår i: IEEE Transactions on Industrial Informatics. - : IEEE. - 1551-3203 .- 1941-0050. ; 15:8, s. 4558-4568
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We propose a two-stage exact approach for identifying finite-state models of function blocks based on given execution traces. First, a base finite-state model is inferred with a method based on translation to the Boolean satisfiability problem, and then, the base model is generalized by inferring minimal guard conditions of the state machine with a method based on translation to the constraint satisfaction problem.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Automata
- control system synthesis
- CSP
- reverse engineering
- SAT
- Dependable Communication and Computation Systems
- Kommunikations- och beräkningssystem
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas