A CEGAR approach for the reachability analysis of PLC-controlled chemical plants

In this paper we address the safety analysis of chemical plants controlled by programmable logic controllers (PLCs). We consider sequential function charts (SFCs)for the programming of the PLCs, extended with the specification of the dynamic plant behavior. The resulting hybrid SFC models can be transformed to hybrid automata, opening the way to the application of advanced techniques for their reachability analysis. However, the hybrid automata models are often too large to be analyzed. To keep the size of the models moderate, we propose a counterexample-guided abstraction refinement (CEGAR) approach, which starts with the purely discrete SFC model of the controller and extends it with those parts of the dynamic behavior, which are relevant for proving or disproving safety.

[1]  Marc Segelken.  Abstraction and Counterexample-Guided Construction of omega -Automata for Model Checking of Step-Discrete Linear Hybrid Models , 2007, CAV.

[2]  Olaf Stursberg,et al.  Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement , 2003, TACAS.

[3]  Joël Ouaknine,et al.  Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems , 2003, Int. J. Found. Comput. Sci..

[4]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[5]  Lothar Litz,et al.  Formal methods in PLC programming , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.

[6]  Olaf Stursberg,et al.  Verification of Embedded Supervisory Controllers Considering Hybrid Plant Dynamics , 2005, Int. J. Softw. Eng. Knowl. Eng..

[7]  Sebastian Engell,et al.  A Unifying Semantics for Sequential Function Charts , 2004, SoftSpez Final Report.

[8]  Antoine Girard,et al.  SpaceEx: Scalable Verification of Hybrid Systems , 2011, CAV.

[9]  Zoe Doulgeri,et al.  Validation of a SFC Software Specification by Using Hybrid Automata , 1998 .

[10]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[11]  Goran Frehse,et al.  Non-convex Invariants and Urgency Conditions on Linear Hybrid Automata , 2014, FORMATS.

[12]  Ben Lukoschus,et al.  Compositional verification of industrial control systems : methods and case studies , 2006 .

[13]  Erika Ábrahám,et al.  Hybrid Sequential Function Charts , 2012, MBMV.

[14]  Kim G. Larsen,et al.  Automatic Abstraction Refinement for Timed Automata , 2007, FORMATS.

[15]  Nanette Bauer.  Formale Analyse von sequential function Charts , 2004 .

[16]  Sumit Kumar Jha,et al.  Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction , 2007, HSCC.

[17]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[18]  Sergiy Bogomolov,et al.  Abstraction-Based Guided Search for Hybrid Systems , 2013, SPIN.

[19]  Luciano Baresi,et al.  PLC PROGRAMMING LANGUAGES : A FORMAL APPROACH , 2003 .

[20]  Xin Chen,et al.  Flow*: An Analyzer for Non-linear Hybrid Systems , 2013, CAV.

[21]  Mahesh Viswanathan,et al.  Hybrid automata-based CEGAR for rectangular hybrid systems , 2013, Formal Methods Syst. Des..

[22]  Rajeev Alur,et al.  Counterexample-guided predicate abstraction of hybrid systems , 2003, Theor. Comput. Sci..

[23]  Sumit Kumar Jha,et al.  Refining Abstractions of Hybrid Systems Using Counterexample Fragments , 2005, HSCC.