Application of symbolic and bounded model checking to the verification of logic control systems

The developer of logic control systems is faced with increasing complexity of the functions to be implemented and, at the same time, increasing demands on the reliability of the resulting software. To analyze the reliability of such complex systems formal methods can be applied. One area of the corresponding research is focused on the application of model checking techniques to Programmable Logic Controllers (PLCs). In this paper a new method to formalize PLC programs together with a model of the cyclic behavior of the PLC is presented. The control systems behavior is modeled, and then the program, written in Instruction List, is formalized and integrated into the model. The formalization in SMV language is suitable for verification using BDD and SAT techniques. Both techniques are compared using first results of a case study

[1]  Dieter Zastrow Grundlagen der Automatisierungstechnik , 1983 .

[2]  M.B. Younis,et al.  Visualization of PLC programs using XML , 2004, Proceedings of the 2004 American Control Conference.

[3]  René David,et al.  Petri nets and grafcet - tools for modelling discrete event systems , 1992 .

[4]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[5]  Thomas Hughes Programmable Controllers , 1997 .

[6]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[7]  Georg Frey,et al.  Formalization of PLC programs to sustain reliability , 2004, IEEE Conference on Robotics, Automation and Mechatronics, 2004..

[8]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.