TY - JOUR
T1 - SAT-Based Counterexample-Guided Inductive Synthesis of Distributed Controllers
AU - Chukharev, Konstantin
AU - Suvorov, Dmitrii
AU - Chivilikhin, Daniil
AU - Vyatkin, Valeriy
PY - 2020
Y1 - 2020
N2 - This article proposes a new method for automatic synthesis of distributed discrete-state controllers from given temporal specification and behavior examples. The proposed method develops known synthesis methods to the distributed case, which is a fundamental extension. This method can be applied for automatic generation of correct-by-design distributed control software for industrial automation. The proposed approach is based on reduction to the Boolean satisfiability problem (SAT) and has Counterexample-Guided Inductive Synthesis (CEGIS) at its core. We evaluate the proposed approach using the classical distributed alternating bit protocol.
AB - This article proposes a new method for automatic synthesis of distributed discrete-state controllers from given temporal specification and behavior examples. The proposed method develops known synthesis methods to the distributed case, which is a fundamental extension. This method can be applied for automatic generation of correct-by-design distributed control software for industrial automation. The proposed approach is based on reduction to the Boolean satisfiability problem (SAT) and has Counterexample-Guided Inductive Synthesis (CEGIS) at its core. We evaluate the proposed approach using the classical distributed alternating bit protocol.
KW - Boolean satisfiability
KW - Control system synthesis
KW - Counterexample-guided inductive synthesis
KW - Formal verification
KW - Inference algorithms
KW - Model checking
UR - http://www.scopus.com/inward/record.url?scp=85097345103&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2020.3037780
DO - 10.1109/ACCESS.2020.3037780
M3 - Article
AN - SCOPUS:85097345103
SN - 2169-3536
VL - 8
SP - 207485
EP - 207498
JO - IEEE Access
JF - IEEE Access
M1 - 9257351
ER -