Automatic Inference of Finite-State Plant Models From Traces and Temporal Properties

• Published in: IEEE transactions on industrial informatics Vol. 13; no. 4; pp. 1521 - 1530
• Main Authors: Buzhinsky, Igor, Vyatkin, Valeriy
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.08.2017; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Automata; Automatic model synthesis; Automation; Boolean algebra; closed-loop modeling; Computer simulation; Construction planning; Construction specifications; Data models; Dependable Communication and Computation Systems; industrial automation software; Informatics; Kommunikations- och beräkningssystem; Model checking; SAT; Software; Solid modeling; Synthesis
• ISSN: 1551-3203; 1941-0050; 1941-0050
• DOI: 10.1109/TII.2017.2670146

Closed-loop model checking, a formal verification technique for industrial automation systems, increases the richness of specifications to be checked and reduces the state space to be verified compared to the open-loop case. To be applied, it needs the controller and the plant formal models to be coupled. There are approaches for controller synthesis, but little has been done regarding plant model construction. While manual plant modeling is time consuming and error-prone, discretizing a simulation model of the plant leads to state excess. This paper aims to solve the problem of automatic plant model construction from existing specification, which is represented in the form of plant behavior examples, or traces, and temporal properties. The proposed method, which is based on the translation of the problem to the Boolean satisfiability problem, is evaluated and shown to be applicable on several case study plant model synthesis tasks and on randomly generated problem instances.