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

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

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on industrial informatics 2019-08, Vol.15 (8), p.4558-4568
Main Authors: Chivilikhin, Daniil, Ulyantsev, Vladimir, Shalyto, Anatoly, Vyatkin, Valeriy
Format: Article
Language:English
Subjects:
Automata
Boolean algebra
control system synthesis
Control systems
CSP
Dependable Communication and Computation Systems
IEC Standards
Inference algorithms
Informatics
Input variables
Kommunikations- och beräkningssystem
reverse engineering
SAT
Solvers
State machines
Testing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1551-3203
1941-0050
1941-0050
DOI:10.1109/TII.2019.2891614