Formal Verification of Complex Properties on PLC Programs

Abstract : Formal verification has become a recommended practice in the safety-critical application areas. However, due to the complexity of practical control and safety systems, the state space explosion often prevents the use of formal analysis. In this paper we extend our former verification methodology with effective property preserving reduction techniques. For this purpose we developed general rule-based reductions and a customized version of the Cone of Influence (COI) reduction. Using these methods, the verification of complex requirements formalised with temporal logics (e.g. CTL, LTL) can be orders of magnitude faster. We use the NuSMV model checker on a real-life PLC program from CERN to demonstrate the performance of our reduction techniques.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01398021
Contributor : Hal Ifip <>
Submitted on : Wednesday, November 16, 2016 - 3:39:27 PM
Last modification on : Friday, December 8, 2017 - 6:04:01 PM
Long-term archiving on : Thursday, March 16, 2017 - 4:59:21 PM

File

978-3-662-43613-4_18_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Dániel Darvas, Borja Fernández Adiego, András Vörös, Tamás Bartha, Enrique Blanco Viñuela, et al.. Formal Verification of Complex Properties on PLC Programs. 34th Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2014, Berlin, Germany. pp.284-299, ⟨10.1007/978-3-662-43613-4_18⟩. ⟨hal-01398021⟩

Share

Metrics

Record views

71

Files downloads

160