.png){kind=icon}
.png){kind=icon}
Return
Function Block Finite-State Model Identification Using SAT and CSP Solvers
.png){kind=icon}
PRE
AI
DOI：10.1109/TII.2019.2891614.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.9
Papers:
8.3K
Citations:
6.0W