Function Block Finite-State Model Identification Using SAT and CSP Solvers

Document identifier: oai:DiVA.org:ltu-75721
Access full text here:10.1109/TII.2019.2891614
Keyword: Natural Sciences, Computer and Information Sciences, Computer Sciences, Naturvetenskap, Data- och informationsvetenskap, Datavetenskap (datalogi), Automata, Control system synthesis, CSP, Reverse engineering, SAT, Dependable Communication and Computation Systems, Kommunikations- och beräkningssystem
Publication year: 2019
Relevant Sustainable Development Goals (SDGs):
SDG 9 Industry, innovation and infrastructure
The SDG label(s) above have been assigned by OSDG.ai

Abstract:

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.

Authors

Daniil Chivilikhin

Computer Technologies Laboratory, ITMO University, St. Petersburg, Russia
Other publications >>

Vladimir Ulyantsev

Computer Technologies Laboratory, ITMO University, St. Petersburg, Russia
Other publications >>

Anatoly Shalyto

Computer Technologies Laboratory, ITMO University, St. Petersburg, Russia
Other publications >>

Valeriy Vyatkin

Luleå tekniska universitet; Datavetenskap; Department of Electrical Engineering and Automation, Aalto University, Espoo, Finland
Other publications >>

Record metadata

Click to view metadata