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

Daniil Chivilikhin; Vladimir Ulyantsev; Anatoly Shalyto; Valeriy Vyatkin

doi:10.1109/TII.2019.2891614

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

Daniil Chivilikhin^*, Vladimir Ulyantsev, Anatoly Shalyto, Valeriy Vyatkin

^*Corresponding author for this work

Research output: Contribution to journal › Article › Scientific › peer-review

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.

Original language	English
Pages (from-to)	4558-4568
Number of pages	11
Journal	IEEE Transactions on Industrial Informatics
Volume	15
Issue number	8
DOIs	https://doi.org/10.1109/TII.2019.2891614
Publication status	Published - Aug 2019
MoE publication type	A1 Journal article-refereed

Keywords

Automata
Control system synthesis
CSP
Reverse engineering
SAT

Access to Document

10.1109/TII.2019.2891614

Cite this

@article{1e9287f28d394825836717c6eef00a77,

title = "Function Block Finite-State Model Identification Using SAT and CSP Solvers",

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.",

keywords = "Automata, Control system synthesis, CSP, Reverse engineering, SAT",

author = "Daniil Chivilikhin and Vladimir Ulyantsev and Anatoly Shalyto and Valeriy Vyatkin",

year = "2019",

month = aug,

doi = "10.1109/TII.2019.2891614",

language = "English",

volume = "15",

pages = "4558--4568",

journal = "IEEE Transactions on Industrial Informatics",

issn = "1551-3203",

number = "8",

}

TY - JOUR

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

AU - Chivilikhin, Daniil

AU - Ulyantsev, Vladimir

AU - Shalyto, Anatoly

AU - Vyatkin, Valeriy

PY - 2019/8

Y1 - 2019/8

N2 - 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.

AB - 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.

KW - Automata

KW - Control system synthesis

KW - CSP

KW - Reverse engineering

KW - SAT

U2 - 10.1109/TII.2019.2891614

DO - 10.1109/TII.2019.2891614

M3 - Article

VL - 15

SP - 4558

EP - 4568

JO - IEEE Transactions on Industrial Informatics

JF - IEEE Transactions on Industrial Informatics

SN - 1551-3203

IS - 8

ER -