Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/tii.2019.2891614 | IEEE Transactions on Industrial Informatics |
Keywords | Field | DocType |
Input variables,Automata,Inference algorithms,IEC Standards,Testing,Control systems,Informatics | Finite state model,Computer science,Boolean satisfiability problem,Automaton,Control engineering,Theoretical computer science,Finite-state machine,Constraint satisfaction problem,Guard (information security),Control system,Iec standards | Journal |
Volume | Issue | ISSN |
15 | 8 | 1551-3203 |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniil Chivilikhin | 1 | 34 | 9.41 |
| Vladimir Ulyantsev | 2 | 60 | 12.44 |
| Anatoly Shalyto | 3 | 98 | 20.06 |
| Valeriy Vyatkin | 4 | 1047 | 152.80 |