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 journalArticleScientificpeer-review


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 languageEnglish
Pages (from-to)4558-4568
Number of pages11
JournalIEEE Transactions on Industrial Informatics
Issue number8
Publication statusPublished - Aug 2019
MoE publication typeA1 Journal article-refereed


  • Automata
  • Control system synthesis
  • CSP
  • Reverse engineering
  • SAT

Cite this